56 search results - page 10 / 12 » Practical Compressed Suffix Trees |
RECOMB
2002
Springer
14 years 9 months ago
2002
Springer
There are many critical situations when one needs to rapidly identify an unidentified pathogen from among a given set of previously sequenced pathogens. DNA or RNA hybridization c...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...
CPM
2004
Springer
14 years 2 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
ALMOB
2008
13 years 8 months ago
2008
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
PG
2002
IEEE
14 years 1 months ago
2002
IEEE
We propose a divide and conquer algorithm for the single resolution encoding of triangle mesh connectivity. Starting from a boundary edge we grow a zig-zag strip which divides the...