Comparison of strings belonging to the same family

Information Sciences

Volumn 111, Issue 1-4, 1998, Pages 49-63

  Elloumi, Mourad ^a  

^a FACULTÉ DES SCIENCES DE TUNIS   (Tunisia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; PROBLEM SOLVING;

LONGEST COMMON SUBSEQUENCE (CS);

COMPUTATIONAL LINGUISTICS;

EID: 0032203376     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(97)10039-1     Document Type: Article

References (37)

1. Aho, A.V., Hopcroft, J.E., Ullman, J.D., 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, pp. 60-65.
2. Alberga, C.N., 1967. Strings similarity and misspellings. Communications of ACM 10 (5), 302-313.
3. Altschul, S.F., Lipman, D.J., 1989. Trees, stars, and multiple biological sequence alignment. SIAM Journal of Applied Mathematics 49 (1), 197-209.
4. Bellman, R.E., 1957. Dynamic programming, Princeton University Press, Princeton, NJ.
5. Bellman, R.E., Dreyfus, S.E., 1962. Applied dynamic programming, Princeton University Press, Princeton, NJ.
6. Beyer, W.A., Stein, M.L., Smith, T.F., Ulman, S.M., 1974. A molecular-sequence metric and evolutionary tree. Mathematical Biosciences 19, 9-25.
7. Damerau, F.J., 1964. A technique for computer detection and correction of spelling errors. Communications of ACM 7 (3), 171-176.
8. Day, W.H.E., Johnson, D.S., Sankoff, D., 1986. The computational complexity of inferring rooted phylogenies by parsimony. Mathematical Biosciences 81, 33-42.
9. Dixon, N.R., Martin, T.B., 1979. Automatic speech and speaker recognition. IEEE Press, New York.
10. Doolittle, R.F. (Ed.), 1990. Molecular evolution: computer analysis of protein and nucleic acid sequences. Methods in Enzymology 183. Academic Press.
11. Ebabil, T., 1992. Méthode de subdivision pour l'alignement multiple. Informatics and Mathematics D.E.A. at the University of Aix-Marseilles II.
12. Elloumi, M., 1994. Analyse de chaînes de caractères codant des macromolécules biologiques, Doctoral Dissertation, The University of Aix-Marseilles III.
13. Fu, K.S., Lu, S.Y., 1977. A clustering procedure for syntactic patterns. IEEE Transactions on Systems, Man and Cybernetics 7 (10), 734-742.
14. Goad, W.B., Kanehisa, M.I., 1982. Pattern recognition in nucleic acid sequences, I. A general method for finding local homologies and symmetries. Nucleic Acid Research 10 (1), 247-263.
15. Gusfield, D., 1988. Efficient algorithms for inferring evolutionary trees, Report CSE-88-4. Computer Science Division, U.C. Davis.
16. Henrissat, B., Claeyssens, M., Tomme, P., Lemesle, L., Mornon, J.P., 1989. Cellulase families revealed by hydrophobic cluster analysis. Gene 81, 83-95.
17. Hirschberg, D.S., 1975. A linear space algorithm for computing maximal common subsequences. Communications of ACM 18 (6), 341-343.
18. Hirschberg, D.S., 1977. Algorithms for the longest common subsequence problem. Journal of ACM 24 (3), 664-675.
19. Johnson, M.S., Doolittle, R.F., 1986. A method for simultaneous alignment of three or more amino acid sequences. J. Molecular Evol. 23, 267-278.
20. Kannan, S., Warnow, T., 1990. Inferring evolutionary history from DNA sequences, Proceedings of the 31st Annual IEEE Symposium on Foundation of Computer Science, St. Louis. pp. 326-371.
21. Karp, R., Miller, R.E., Rosenberg, A.L., 1972. Rapid identification of repeated patterns in strings, trees and arrays. Fourth symposium of theory of computing, pp. 125-136.
22. Landraud, A.M., Avril, J.F., Chrétienne, Ph., 1989. An algorithm for finding a common structure shared by a family of strings. IEEE Transactions on Pattern Analysis and Machine Intelligence 2 (8), 890-895.
23. Lelewer, D.A., Hirschberg, D.S., 1987. Data compression. ACM Computing Survey 3 (19), 261-287.
24. Levenshtein, V.I., 1966. Binary codes capable of correcting deletions, insertions and reversals. Cybernetics and Control Theory 10 (8), 707-710.
25. Maier, D., 1978. The complexity of some problems on subsequences and super sequences. Journal of ACM 25 (2), 322-336.
26. Martinez, H., 1983. An efficient method for finding repeats in molecular sequences. Nucleic Acid Research 11, 4629-4634.
27. Morgan, H.L., 1970. Spellings correction in systems programs. Communications of ACM 13 (2), 90-94.
28. Sakoe, H., Chiba, S., 1978. Dynamic programming algorithms optimization for spoken word recognition. IEEE Transactions on Acoustics, Speech and Signal Processing 26 (1), 43-49.
29. Sankoff, D., 1975. Minimal mutation trees of sequences. SIAM Journal of Applied Mathematics 78, 35-42.
30. Sankoff, D., Kruskal, J.B., 1983. Time warps, string edits and macromolecules: The theory and practice of sequence comparison. Addison-Wesley, Reading, MA.
31. Sobel, E., Martinez, H.M., 1986. A multiple sequence alignment program. Nucleic Acids Research 14 (1), 363-374.
32. Sellers, F.F., 1962. Bit loss and gain correction code. IRE Transactions on Information Theory 8, 35-38.
33. Wagner, R.A., Fischer, M.J., 1974. The string-to-string correction problem. Journal of ACM 21 (1), 168-173.
34. Waterman, M.S., Smith, T.F., Beyer, W.A., 1976. Some biological sequence metrics. Advances in Mathematics 20, 367-387.
35. Waterman, M.S., 1984. General methods of sequence comparison. Bulletin of Mathematical Biology 46 (4), 473-500.
36. Waterman, M.S., 1989. Mathematical methods for DNA sequences. CRC Press, Boca Raton, FL.
37. Wilbur, W.J., Lipman, D.J., 1983. Rapid similarity searches of nucleic acid and protein data banks. Proceedings of the National Academy of Sciences (USA) 18, 726-730.