Sciweavers

CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
15 years 2 months ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang
CPM
2005
Springer
194views Combinatorics» more  CPM 2005»
15 years 2 months ago
DNA Compression Challenge Revisited: A Dynamic Programming Approach
Behshad Behzadi, Fabrice Le Fessant
CPM
2005
Springer
142views Combinatorics» more  CPM 2005»
15 years 2 months ago
Assessing the Significance of Sets of Words
Valentina Boeva, Julien Clément, Mireille R...
CPM
2005
Springer
125views Combinatorics» more  CPM 2005»
14 years 11 months ago
Parametric Analysis for Ungapped Markov Models of Evolution
We present efficient sensitivity-analysis algorithms for two problems involving Markov models of sequence evolution: ancestral reconstruction in evolutionary trees and local ungap...
David Fernández-Baca, Balaji Venkatachalam
CPM
2005
Springer
123views Combinatorics» more  CPM 2005»
15 years 2 months ago
A Simple Fast Hybrid Pattern-Matching Algorithm
Abstract. The Knuth-Morris-Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the...
Frantisek Franek, Christopher G. Jennings, William...
Combinatorics
Top of PageReset Settings