140
click to vote
CPM
15 years 6 months ago
2005 Springer 
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...
68
Voted
CPM
15 years 6 months ago
2005 Springer  68
Voted
CPM
15 years 6 months ago
2005 Springer  108
Voted
CPM
15 years 2 months ago
2005 Springer
We present efficient sensitivity-analysis algorithms for two problems involving Markov models of sequence evolution: ancestral reconstruction in evolutionary trees and local ungap...
109
click to vote
CPM
15 years 6 months ago
2005 Springer
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...
|
Combinatorics