A sum-over-paths extension of edit distances accounting for all sequence alignments

Pattern Recognition

Volumn 44, Issue 6, 2011, Pages 1172-1182

  García Díez, Silvia ^a   Fouss, François ^b   Shimbo, 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

Approximate string matching; Dynamic programming; Edit distance; Longest common subsequence; Sequence comparison; Shortest path; Viterbi algorithm

Indexed keywords

APPROXIMATE STRING MATCHING; EDIT DISTANCE; LONGEST COMMON SUBSEQUENCES; SEQUENCE COMPARISON; SHORTEST PATH; VITERBI;

ALIGNMENT; BIOINFORMATICS; CLASSIFICATION (OF INFORMATION); COSTS; GRAPH THEORY; OPTIMIZATION; VITERBI ALGORITHM;

DYNAMIC PROGRAMMING;

EID: 79551543523     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2010.11.020     Document Type: Article

References (70)

1. Y. Achbany, F. Fouss, L. Yen, A. Pirotte, M. Saerens, Optimal tuning of continual exploration in reinforcement learning, in: Proceedings of the 16th International Conference on Artificial Neural Networks (ICANN 06), Lecture Notes in Computer Science, vol. 4131, 2006, pp. 734749.
2. Y. Achbany, F. Fouss, L. Yen, A. Pirotte, and M. Saerens Tuning continual exploration in reinforcement learning: an optimality property of the Boltzmann strategy Neurocomputing 71 2008 2507 2520
3. T. Akamatsu Cyclic flows, Markov process and stochastic traffic assignment Transportation Research B 30 5 1996 369 386
4. Juan-Carlos Amengual and Enrique Vidal. On the estimation of error-correcting parameters, in: Proceedings of the International Conference on Pattern Recognition (ICPR), 2000, pp. 28832886.
5. V.L. Arlazarov, E.A. Dinic, M.A. Kronod, and I.A. Faradzev On economical construction of the transitive closure of an oriented graph Doklady Akademii Nauk SSSR 194 1970 487 488
6. L.R. Bahl, and F. Jelinek Decoding for channels with insertions, deletions, and substitutions with applications to speech recognition IEEE Transactions on Information Theory 21 4 1975 404 411
7. F. Beuvens, T. Dullier, Développement et expérimentation d'une plate-forme de reconnaissance de gestes par stylet, Master's Thesis, Université Catholique de Louvain, 2009.
8. I. Borg, and P. Groenen Modern Multidimensional Scaling: Theory and Applications 1997 Springer New York
9. S. Boyd, P. Diaconis, and L. Xiao Fastest mixing Markov chain on a graph SIAM Review 2004 667 689
10. P. Bucher, K. Hofmann, A sequence similarity search algorithm based on a probabilistic interpretation of an alignment scoring system, in: Proceedings of the 4th International Conference on Intelligent Systems for Molecular Biology (ISMB 1996), AAAI, 1996.
11. N. Cancedda, E. Gaussier, C. Goutte, and J.M. Renders Word sequence kernels Journal of Machine Learning Research 3 2003 1059 1082
12. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to Algorithms second ed. 2000 MIT Press, McGraw-Hill Book Company Cambridge, Massachusetts
13. T.M. Cover, and J.A. Thomas Elements of Information Theory 1991 John Wiley & Sons New Jersey
14. T. Cox, and M. Cox Multidimensional Scaling second ed. 2001 Chapman and Hall Boca Raton, Floride
15. J.-C. Delvenne, A.-S. Libert, Centrality measures and thermodynamic formalism for complex networks, Manuscript, submitted for publication.
16. C.B. Do, S.S. Gross, S. Batzoglou, CONTRAlign: discriminative training for protein sequence alignment, in: Proceedings of the 10th Annual International Conference on Computational Molecular Biology (RECOMB 2006), 2006.
17. R. Durbin, S.R. Eddy, A. Krogh, and G. Mitchison Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids 1998 Cambridge University Press Cambridge
18. L. Ekroot, and T. Cover The entropy of Markov trajectories IEEE Transactions on Information Theory 39 4 1993 1418 1421
19. R.-E. Fan, K.-W. Chang, C.-J. Hsieh, X.-R. Wang, and C.-J. Lin LIBLINEAR: a library for large linear classification Journal of Machine Learning Research 9 2008 1871 1874
20. G.D. Fornay The Viterbi algorithm Proceedings of the IEEE 61 3 1973 268 278
21. V. Girardin Entropy minimization for Markov and semi-Markov processes Methodology and Computing in Applied Probability 6 2004 109 127
22. V. Girardin, and N. Limnios Entropy rate and maximum entropy methods for countable semi-Markov chains Communications in Statistics 33 3 2004 609 622
23. D. Gusfield Algorithms on Strings, Trees, and Sequences 1997 Cambridge University Press Cambridge
24. X. Huang, Y. Ariki, and M. Jack Hidden Markov Models for Speech Recognition 1990 Columbia University Press New York, NY, USA
25. T. Hwa, and M. Lssig Similarity detection and localization Physical Review Letters 76 1996 2591
26. T. Jaakkola, M. Diekhans, and D. Haussler A discriminative framework for detecting remote protein homologies Journal of Computational Biology 7 12 2000 95 114
27. D. Jurafsky, and J.H. Martin Speech and Language Processing second ed. 2008 Prentice Hall Upper Saddle River, New Jersey
28. A. Krogh, M. Brown, I.S. Mian, K. Sjlander, and D. Haussler Hidden Markov models in computational biology: applications to protein modeling Journal of Molecular Biology 235 5 1994 1501 1531
29. J.B. Kruskal An overview of sequence comparison: time warps, string edits, and macromolecules SIAM Review 25 1983 201 237
30. M. Kschischo, and M. Lssig Finite-temperature sequence alignment Pacific Symposium on Biocomputing 5 2000 624 635
31. C.S. Leslie, E. Eskin, A. Cohen, J. Weston, and W. Stafford Noble Mismatch string kernels for discriminative protein classification Bioinformatics 20 4 2004 467 476
32. C.S. Leslie, E. Eskin, W.S. Noble, The spectrum kernel: a string kernel for SVM protein classification, in: Pacific Symposium on Biocomputing, 2002, pp. 566575.
33. L. Liao, and W. Stafford Noble Combining pairwise sequence similarity and support vector machines for remote protein homology detection RECOMB '02: Proceedings of the 6th Annual International Conference on Computational Biology 2002 ACM 225 232
34. M.L. Littman, Markov games as a framework for multi-agent reinforcement learning, in: Proceedings of the 11th International Conference on Machine Learning (ICML-94), 1994, pp. 157163.
35. H. Lodhi, C. Saunders, J. Shawe-Taylor, N. Cristianini, C. Watkins, and B. Scholkopf Text classification using string kernels Journal of Machine Learning Research 2 2002 563 569
36. A. Mantrach, L. Yen, J. Callut, K. Franoisse, M. Shimbo, and M. Saerens The sum-over-paths covariance kernel: a novel covariance measure between nodes of a directed graph IEEE Transactions Pattern Analysis and Machine Intelligence 32 6 2010 1112 1126
37. A. Marzal, and E. Vidal Computation of normalized edit distance and applications IEEE Transactions on Pattern Analysis and Machine Intelligence 15 9 1993 926 932
38. S. Miyazawa A reliable sequence alignment method based on probabilities of residue correspondences Protein Engineering 8 1995 999 1009
39. G. Navarro A guided tour to approximate string matching ACM Computing Surveys 33 1 2001 31 88 (Pubitemid 33768480)
40. L.A. Newberg, and C.E. Lawrence Exact calculation of distributions on integers, with application to sequence alignment Journal of Computational Biology: A Journal of Computational Molecular Cell Biology 16 1 2009 1 18
41. J. Oncina, and M. Sebban Learning stochastic edit distance: application in handwritten character recognition Pattern Recognition 39 9 2006 1575 1587
42. M.J. Osborne An Introduction to Game Theory 2004 Oxford University Press Oxford
43. L. Rabiner, and B. Hwang Juang Fundamentals of Speech Recognition April 1993 Prentice Hall PTR Englewood Cliffs, New Jersey
44. L. Rabiner Readings in Speech Recognition. chapter A tutorial on hidden Markov models and selected applications in speech recognition 1990 Morgan Kaufmann Publishers Inc. pp. 267296
45. E. Ricci, T. De Bie, N. Cristianini, Learning to align: a statistical approach, in: Proceedings of the 7th International Symposium on Intelligent Data Analysis (IDA 2007), Ljubljana, 2007.
46. E. Ristad, and P. Yianilos Learning string-edit distance IEEE Transactions on Pattern Analysis and Machine Intelligence 20 5 1998 522 532
47. E. Sven Ristad, and P.N. Yianilos Learning string-edit distance IEEE Transactions on Pattern Analysis and Machine Intelligence 20 5 1998 522 532
48. J. Rousu, and J. Shawe-Taylor Efficient computation of gapped substring kernels on large alphabets Journal of Machine Learning Research 6 2005 1323 1344
49. M. Saerens, Y. Achbany, F. Fouss, and L. Yen Randomized shortest-path problems: two related models Neural Computation 21 8 2009 2363 2404
50. H. Saigo, J.-P. Vert, N. Ueda, and T. Akutsu Protein homology detection using string alignment kernels Bioinformatics 20 11 2004 1682 1689
51. D. Sankoff, and J.B. Kruskal Time Warps, String Edits, and Macromolecules 1983 Addison-Wesley Stanford, California
52. J. Shawe-Taylor, and N. Cristianini Kernel Methods for Pattern Analysis 2004 Cambridge University Press Cambridge
53. M. Steel, and J. Hein Applying the ThorneKishinoFelsenstein model to sequence evolution on a star-shaped tree Applied Mathematics Letters 14 2001 679 684
54. G. Stephen String Searching Algorithms 1994 World Scientific Singapore
55. J. Sun, S. Boyd, L. Xiao, and P. Diaconis The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem SIAM Review 2006 681 699
56. A. Tahbaz, A. Jadbabaie, A one-parameter family of distributed consensus algorithms with boundary: from shortest paths to mean hitting times, in: Proceedings of IEEE Conference on Decision and Control, 2006, pp. 46644669.
57. S. Theodoridis, and K. Koutroumbas Pattern Recognition third ed. 2006 Academic Press
58. J.L. Thorne, H. Kishino, and J. Felsenstein An evolutionary model for maximum likelihood alignment of dna sequences Journal of Molecular Evolution 33 1991 114 124
59. J.L. Thorne, H. Kishino, and J. Felsenstein Inching toward reality: an improved likelihood model of sequence evolution Journal of Molecular Evolution 34 1992 3 16
60. E. Todorov Linearly-solvable Markov decision problems Advances in Neural Information Processing Systems 19 (NIPS 2006) 2006 MIT Press 1369 1375
61. J. Tomlin, A new paradigm for ranking pages on the world wide web, in: Proceedings of the International World Wide Web Conference (WWW2003), 2003, pp. 350355.
62. E. Vidal, A. Marzal, and P. Aibar Fast computation of normalized edit distances IEEE Transactions on Pattern Analysis and Machine Intelligence 17 9 1995 899 902
63. S.V.N. Vishwanathan, K.M. Borgwardt, R.I. Kondor, and N.N. Schraudolph Graph kernels Journal of Machine Learning Research 11 2010 1201 1242
64. S.V.N. Vishwanathan, K.M. Borgwardt, and N.N. Schraudolph Fast computation of graph kernels Advances in Neural Information Processing Systems 19: Proceedings of the 2006 Conference 2007 MIT Press Cambridge MA, USA
65. S.V.N. Vishwanathan, and A.J. Smola Fast kernels for string and tree matching Advances in Neural Information Processing Systems 15 2003 MIT Press 569 576
66. R.A. Wagner, and M.J. Fischer The string-to-string correction problem Journal of the ACM 21 1 1974 168 173
67. M.S. Waterman, and M. Eggert A new algorithm for best subsequence alignments with application to trna-rrna comparisons Journal of Molecular Biology 197 4 1987 723 728
68. C. Watkins, Kernels from matching operations, Technical Report, Department of Computer Science, Royal Holloway, University of London, 1999.
69. L. Yen, A. Mantrach, M. Shimbo, M. Saerens, A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances, in: Proceedings of the 14th SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008, pp. 785793.
70. M.Q. Zhang, and T.G. Marr Alignment of molecular sequences seen as random path analysis Journal of Theoretical Biology 174 2 1995 119 129