|
4
|
Efficient Algorithms for Sequence Analysis with Concave and Convex Gap Costs
– David A. Eppstein
- 1989
|
|
1
|
Computational Biology
– Rune B. Lyngsø, Rune B. Lyngs, Rune Bang Lyngs
- 2000
|
|
1
|
Discrete Pattern Matching Over Sequences And Interval Sets
– James Robert Knight
- 1993
|
|
7
|
Sequence Comparison: Some Theory and Some Practice
– Imre Simon
- 1988
|
|
1
|
Noisy Subsequence Recognition Using Constrained String Editing Involving Substitutions, Insertions, Deletions and Generalized Transpositions
– B. J. Oommen, R. K. S. Loke
- 1994
|
|
|
Approximate Text Searching
– Gonzalo Navarro Badino
- 1998
|
|
2
|
String Taxonomy Using Learning Automata
– B. John Oommen, Edward V. De St. Croix
- 1997
|
|
26
|
Algorithms and Complexity for Annotated Sequence Analysis
– Patricia Anne Evans, Dr. Michael, R. Fellows
- 1999
|
|
2
|
Algorithms for Sequence Alignment
– David Richard Powell
- 2002
|
|
306
|
A Guided Tour to Approximate String Matching
– Gonzalo Navarro
- 1999
|
|
130
|
Optimal alignments in linear space
– Eugene W. Myers, Webb Miller
- 1988
|
|
|
Pattern Recognition of Strings Containing Traditional and Generalized Transposition Errors
– B. J. Oommen, R. K. S. Loke
|
|
8
|
Pattern Recognition of Strings With Substitutions, Insertions, Deletions and Generalized Transpositions
– B. J. Oommen, R. K. S. Loke
|
|
25
|
Longest Common Subsequences
– Mike Paterson, Vlado Dancik
- 1994
|
|
1
|
Discovering Optimization Algorithms through Automated Learning
– Eric Breimer, Mark Goldberg, David Hollinger, Darren Lim
|
|
17
|
Expected Length of Longest Common Subsequences
– Vladimír Dancík
|
|
7
|
On-line approximate string searching algorithms: survey and experimental results
– P. D. Michailidis, K. G. Margaritis
- 2002
|
|
1
|
Accelerating Dynamic Programming
– Oren Weimann, Erik D. Demaine
- 2009
|
|
19
|
Speeding up Dynamic Programming
– David Eppstein, Zvi Galil, Raffaele Giancarlo
- 1988
|
