|
3
|
A Formal Theory for Optimal and Information Theoretic Syntactic Pattern Recognition
– B. J. Oommen, R. L. Kashyap
|
|
1
|
Noisy Subsequence Recognition Using Constrained String Editing Involving Substitutions, Insertions, Deletions and Generalized Transpositions
– B. J. Oommen, R. K. S. Loke
- 1994
|
|
|
Pattern Recognition of Strings Containing Traditional and Generalized Transposition Errors
– B. J. Oommen, R. K. S. Loke
|
|
2
|
String Taxonomy Using Learning Automata
– B. John Oommen, Edward V. De St. Croix
- 1997
|
|
10
|
The Normalized String Editing Problem Revisited
– B. J. Oommen, K. Zhang
- 1996
|
|
1
|
Optimal and Information Theoretic Syntactic Pattern Recognition for Traditional Errors
– B. J. Oommen, R. L. Kashyap
- 1996
|
|
8
|
Measuring the Accuracy of Page-Reading Systems
– Stephen V. Rice
- 1996
|
|
1
|
Discrete Pattern Matching Over Sequences And Interval Sets
– James Robert Knight
- 1993
|
|
6
|
Bit-Parallel LCS-length Computation Revisited
– Heikki Hyyrö
- 2004
|
|
7
|
Sequence Comparison: Some Theory and Some Practice
– Imre Simon
- 1988
|
|
25
|
Longest Common Subsequences
– Mike Paterson, Vlado Dancik
- 1994
|
|
158
|
Learning String Edit Distance
– Eric Sven Ristad, Peter N. Yianilos
- 1997
|
|
17
|
Expected Length of Longest Common Subsequences
– Vladimír Dancík
|
|
5
|
Symbolic Channel Modelling For Noisy Channels Which Permit Arbitrary Noise Distributions
– Oommen And Kashyap, B. J. Oommen, R. L. Kashyap
- 1993
|
|
133
|
An O(ND) Difference Algorithm and Its Variations
– Eugene W. Myers
- 1986
|
|
|
Learning String Edit Distance 1
– Eric Sven Ristad, Peter N. Yianilos
- 1996
|
|
|
String comparison by transposition networks
– Peter Krusche, Er Tiskin
- 903
|
|
|
Approximate Text Searching
– Gonzalo Navarro Badino
- 1998
|
|
5
|
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms
– Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon
- 2003
|
