170 search results - page 18 / 34 » Algorithms on Compressed Strings and Arrays |
103
click to vote
BMCBI
2008
14 years 9 months ago
2008
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
ESA
1998
Springer
15 years 1 months ago
1998
Springer
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
TIP
2002
14 years 9 months ago
2002
Using an array of photo shots, the concentric mosaic offers a quick way to capture and model a realistic three-dimensional (3-D) environment. In this work, we compress the concentr...
STOC
2000
ACM
15 years 2 months ago
2000
ACM
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
115
click to vote
BMCBI
2010
14 years 7 months ago
2010
Background: Traditional genome alignment methods consider sequence alignment as a variation of the string edit distance problem, and perform alignment by matching characters of th...