Fast Algorithm for Sequence Edit Distance Computation

Author(s):  
Hou-Sheng Chen ◽  
Li-Ren Liu ◽  
Jian-Jiun Ding
Algorithmica ◽  
2011 ◽  
Vol 65 (2) ◽  
pp. 339-353 ◽  
Author(s):  
Danny Hermelin ◽  
Gad M. Landau ◽  
Shir Landau ◽  
Oren Weimann

2019 ◽  
Vol 163 ◽  
pp. 762-775 ◽  
Author(s):  
Xiaoyang Chen ◽  
Hongwei Huo ◽  
Jun Huan ◽  
Jeffrey Scott Vitter

Author(s):  
Muhammad Murtaza Yousaf ◽  
◽  
Muhammad Umair Sadiq ◽  
Laeeq Aslam ◽  
Waqar ul Qounain ◽  
...  

2019 ◽  
Vol 29 (1) ◽  
pp. 419-458 ◽  
Author(s):  
David B. Blumenthal ◽  
Nicolas Boria ◽  
Johann Gamper ◽  
Sébastien Bougleux ◽  
Luc Brun

2001 ◽  
Vol 01 (02) ◽  
pp. 363-386
Author(s):  
WLADIMIR RODRIGUEZ ◽  
MARK LAST ◽  
ABRAHAM KANDEL ◽  
HORST BUNKE

In this paper, a new, geometric approach to pattern identification in data mining is presented. It is based on applying string edit distance computation to measuring the similarity between multi-dimensional curves. The string edit distance computation is extended to allow the possibility of using strings, where each element is a vector rather than just a symbol. We discuss an approach for representing 3D-curves using the curvature and the tension as their symbolic representation. This transformation preserves all the information contained in the original 3D-curve. We validate this approach through experiments using synthetic and digitalized data. In particular, the proposed approach is suitable to measure the similarity of 3D-curves invariant under translation, rotation, and scaling. It also can be applied for partial curve matching.


Author(s):  
Khaled Balhaf ◽  
Mohammed A. Shehab ◽  
Wala'a T. Al-Sarayrah ◽  
Mahmoud Al-Ayyoub ◽  
Mohammed Al-Saleh ◽  
...  

2017 ◽  
Vol 88 ◽  
pp. 81-87 ◽  
Author(s):  
Lorraine A.K. Ayad ◽  
Carl Barton ◽  
Solon P. Pissis

Author(s):  
Reza Farivar ◽  
Harshit Kharbanda ◽  
Shivaram Venkataraman ◽  
Roy H. Campbell

Sign in / Sign up

Export Citation Format

Share Document