Topology of strings: Median string is NP-complete

Theoretical Computer Science

Volumn 230, Issue 1-2, 2000, Pages 39-48

  De La Higuera, C ^a   Casacuberta, F ^b  

^a LIRMM   (France)

^b UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Generalised Median; Levenshtein distance; Multiple sequence alignment; NP complete problems; String to string correction

Indexed keywords

EID: 0001922584     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00240-5     Document Type: Article

References (17)

1. P. Aibar, M.J. Castro, F. Casacuberta, E. Vidal, Multiple template modelling of sublexical units, in: P. Laface (Ed.), Speech Recognition and Understanding Recent Advances, Trends and Applications, NATO ASI Series, Springer, Berlin, 1991, pp. 519-524.
2. A.V. Aho, Algorithms for finding patterns in strings, Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, pp. 290-300.
3. F. Casacuberta, M.D. Antonio, A greedy algorithm for computing approximate median strings, in: Proc. VII Spanish Symp. on Pattern Recognition and Image Analysis, Bellaterra, 1997, to appear.
4. S.C. Chan, A.K.C. Wong, D.K.Y. Chiu, A survey of multiple sequence comparison methods, Bull. Math. Biol. 54 (4) (1992) 563-598.
5. K.S. Fu, Syntactic Pattern Recognition and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1982.
6. S. Ganguly, J. Leichter, M. Noodewier, Fast search methods for biological sequence databases, LCSR-Tech. Report 217, 1993.
7. M.R. Garey, D.S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979.
8. P. Hansen, M. Labbé, J.-F. Thisse, From the median to the generalized center, Oper. Res. 25(1) (1991) 73-86.
9. T. Kohonen, Median strings, Pattern Recognition Lett. 3 (1985) 309-313.
10. J.B. Kruskal, D. Sankoff, An anthology of algorithms and concepts for sequence comparison, in: D. Sankoff, J.B. Kruskal (Eds.), Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, Addison-Wesley, Reading, MA, 1983.
11. L. Miclet, Méthodes Structurelles pour la Reconnaissance des Formes, Eyrolles, Paris, 1984.
12. M-F. Sagot, A. Viari, H. Soldano, Multiple sequence comparison: a peptide matching approach, in: 6th Symp. on Comb. Pattern Matching, Helsinki, 1995.
13. G.A. Stephen, String Searching Algorithms, Lecture Notes Series on Computing, vol. 3, World Scientific, Singapore, 1994.
14. E. Ukkonen, Finding approximate patterns in strings, J. Algorithms, 6 (1985) 132-137.
15. R. Wagner, M. Fisher, The string-to-string correction problem, J. ACM 21 (1974) 168-178.
16. L. Wang, T. Jiang, On the complexity of multiple sequence alignment, J. Computat. Biol. 1 (4) (1994) 337-348.
17. L. Wang, T. Jiang, E.L. Lawler, Approximation algorithms for tree alignment with a given phylogeny, Algorithmica 16 (3) (1996) 302-315.