Sciweavers

223 search results - page 28 / 45
» Suffix Arrays on Words
Sort
View
JAT
2010
171views more  JAT 2010»
13 years 2 months ago
Chebyshev approximation of the null function by an affine combination of complex exponential functions
We describe the theoretical solution of an approximation problem that uses a finite weighted sum of complex exponential functions. The problem arises in an optimization model for t...
Paul Armand, Joël Benoist, Elsa Bousquet
LRE
2008
96views more  LRE 2008»
13 years 7 months ago
Language resources for Hebrew
Abstract. We describe a suite of standards, resources and tools for computational encoding and processing of Modern Hebrew texts. These include an array of XML schemas for represen...
Alon Itai, Shuly Wintner
TCS
2010
13 years 2 months ago
The relevant prefixes of coloured Motzkin walks: An average case analysis
In this paper we study some relevant prefixes of coloured Motzkin walks (otherwise called coloured Motzkin words). In these walks, the three kinds of step can have , and colours...
Donatella Merlini, Renzo Sprugnoli
BMCBI
2010
121views more  BMCBI 2010»
13 years 7 months ago
MS4 - Multi-Scale Selector of Sequence Signatures: An alignment-free method for classification of biological sequences
Background: While multiple alignment is the first step of usual classification schemes for biological sequences, alignment-free methods are being increasingly used as alternatives...
Eduardo Corel, Florian Pitschi, Ivan Laprevotte, G...
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 7 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro