Paper Info
Title
Multi-seed Lossless Filtration (Extended abstract)
Abstract
We study a method of seed-based lossless filtration for approximate string matching and related applications. The method is based on a simultaneous use of several spaced seeds rather than a single seed as studied by Burkhardt and Karkkainen (1). We present algorithms to com- pute several important parameters of seed families, study their combinatorial properties, and describe several techniques to construct efficient families. We also report a large-scale application of the proposed technique to the problem of oligonucleotide selection for an EST sequence database.
Year
DOI
Venue
2004
10.1007/978-3-540-27801-6_22
CPM
Keywords
Field
DocType
approximate string matching
Sequence database,Computer science,Algorithm,Theoretical computer science,Filtration,Approximate string matching,Pattern matching,Lossless compression
Conference
Volume
Citations 
PageRank 
3109
2
0.47
References 
Authors
15
3
Name
Order
Citations
PageRank
Gregory Kucherov1100374.54
Laurent Noé223013.94
Mikhail A. Roytberg311454.66