Name
Abstract | ||
|---|---|---|
We describe a new metric for sequence comparison that emphasizes global similarity over sequential matching at the local level. It has the advantage over the Levenshtein metric that strings of lengths n and m can be compared in time proportional to n + m instead of nm . Various mathematical properties of the metric are established. |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1016/0166-218X(88)90076-5 | Discrete Applied Mathematics |
Keywords | Field | DocType |
strings computable,distance metric,partial match,editing,text processing,linear time,spelling correction,sequence comparison,string matching,new distance,clustering | Edit distance,Chebyshev distance,Discrete mathematics,Combinatorics,Fisher information metric,Metric (mathematics),Intrinsic metric,Stein's method,String metric,Mathematics,Injective metric space | Journal |
Volume | Issue | ISSN |
20 | 3 | Discrete Applied Mathematics |
Citations | PageRank | References |
16 | 6.31 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Ehrenfeucht | 1 | 1823 | 497.83 |
| David Haussler | 2 | 8327 | 3068.93 |