Normalized sum-over-paths edit distances

Proceedings - International Conference on Pattern Recognition

Volumn , Issue , 2010, Pages 1044-1047

  Díez, Silvia García ^a   Foussy, François ^b   Shimboz, Masashi ^c   Saerens, Marco ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b Facultes Universitaires Catholiques de Mons   (Belgium)

^c NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Edit distance; Longest common subsequence; Normalization; Randomized shortest paths

Indexed keywords

CLASSIFICATION TASKS; DATA SETS; EDIT DISTANCE; EXPECTED COSTS; LONGEST COMMON SUBSEQUENCES; NORMALIZATION; OPTIMAL ALIGNMENTS; SEQUENCE ALIGNMENTS; SHORTEST PATH; STANDARD DISTANCE; TIME COMPLEXITY;

CLASSIFICATION (OF INFORMATION); GRAPH THEORY; OPTIMIZATION; PATTERN RECOGNITION;

ALIGNMENT;

EID: 78149473042     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPR.2010.261     Document Type: Conference Paper

References (18)

1. S. Theodoridis and K. Koutroumbas, Pattern recognition, 3th edition. Academic Press, 2006.
2. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to algorithms, 2nd edition. MIT Press, McGraw-Hill Book Company, 2000.
3. G. Stephen, String searching algorithms. World Scientific, 1994.
4. D. Jurafsky and J. H. Martin, Speech and language processing (2nd Edition). Prentice Hall, 2008.
5. R. Durbin, S. R. Eddy, A. Krogh, and G. Mitchison, Biological sequence analysis: Probabilistic models of proteins and nucleic acids. Cambridge University Press, 1998.
6. J. B. Kruskal, "An overview of sequence comparison: Time warps, string edits, and macromolecules," SIAM Review, vol. 25, pp. 201-237, 1983.
7. D. Sankoff and J. B. Kruskal, Eds., Time warps, string edits, and macromolecules. Addison-Wesley, 1983.
8. W. J. Masek and M. Paterson, "A faster algorithm computing string edit distances." Journal of Computer System Science, vol. 20, no. 1, pp. 18-31, 1980.
9. D. S. Hirschberg, "Algorithms for the longest common subsequence problem," Journal of the ACM, vol. 24, no. 4, pp. 664-675, 1977.
10. A. Marzal and E. Vidal, "Computation of normalized edit distance and applications," IEEE Trans. PAMI, vol. 15, no. 9, pp. 926-932, 1993.
11. E. Vidal, A. Marzal, and P. Aibar, "Fast computation of normalized edit distances," IEEE Trans. PAMI, vol. 17, no. 9, pp. 899-902, 1995.
12. B. J. Oommen and K. Zhang, "The normalized string editing problem revisited," IEEE Trans. PAMI, vol. 18, no. 6, pp. 669-672, 1996.
13. L. Yujian and L. Bo, "A normalized levenshtein distance metric," IEEE Trans. PAMI, vol. 29, no. 6, pp. 1091-1095, 2007.
14. A. Weigel and F. Fein, "Normalizing the weighted edit distance," in ICPR 12, 1994, pp. 399-402.
15. S. García Díez, F. Fouss, M. Shimbo, and S. Saerens, "A sum-over-paths extension of edit distances accounting for all sequence alignments," 2009, submitted for publication. [Online]. Available: http://www.isys.ucl.ac.be/staff/marco/Publications/2009- SumOverPathsExtensionOfEdit.pdf
16. J. Shawe-Taylor and N. Cristianini, Kernel Methods for Pattern Analysis. Cambridge University Press, 2004.
17. M. Saerens, Y. Achbany, F. Fouss, and L. Yen, "Randomized shortest-path problems: Two related models," Neural Computation, vol. 21, no. 8, pp. 2363-2404, 2009.
18. J. Oncina and M. Sebban, "Learning stochastic edit distance: Application in handwritten character recognition," Pattern Recognition, vol. 39, no. 9, pp. 1575-1587, 2006.