Sciweavers

CPM
2006
Springer
175views Combinatorics» more  CPM 2006»
15 years 7 months ago
On-Line Linear-Time Construction of Word Suffix Trees
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
Shunsuke Inenaga, Masayuki Takeda
CPM
2006
Springer
145views Combinatorics» more  CPM 2006»
15 years 7 months ago
Approximation of RNA Multiple Structural Alignment
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
Marcin Kubica, Romeo Rizzi, Stéphane Vialet...
CPM
2006
Springer
114views Combinatorics» more  CPM 2006»
15 years 7 months ago
New Algorithms for Text Fingerprinting
Roman Kolpakov, Mathieu Raffinot
CPM
2006
Springer
117views Combinatorics» more  CPM 2006»
15 years 7 months ago
A Compact Mathematical Programming Formulation for DNA Motif Finding
Carl Kingsford, Elena Zaslavsky, Mona Singh
CPM
2006
Springer
115views Combinatorics» more  CPM 2006»
15 years 7 months ago
Statistical Encoding of Succinct Data Structures
Rodrigo González, Gonzalo Navarro