Sciweavers

5 search results - page 1 / 1
» Cover Array String Reconstruction
Sort
View
CPM
2010
Springer
127views Combinatorics» more  CPM 2010»
13 years 10 months ago
Cover Array String Reconstruction
A proper factor u of a string y is a cover of y if every letter of y is within some occurrence of u in y. The concept generalises the notion of periods of a string. An integer arra...
Maxime Crochemore, Costas S. Iliopoulos, Solon P. ...
IJFCS
2006
108views more  IJFCS 2006»
13 years 5 months ago
Reconstructing a Suffix Array
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
Frantisek Franek, William F. Smyth
JACM
2006
112views more  JACM 2006»
13 years 5 months ago
Linear work suffix array construction
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
Juha Kärkkäinen, Peter Sanders, Stefan B...
VISUALIZATION
1994
IEEE
13 years 9 months ago
An Evaluation of Reconstruction Filters for Volume Rendering
To render images from a three-dimensional array of sample values, it is necessary to interpolate between the samples. This paper is concerned with interpolation methods that are e...
Stephen R. Marschner, Richard Lobb
JMLR
2008
148views more  JMLR 2008»
13 years 5 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov