Calcul de la distance par les sous-mots
Hebrard, Jean-Jacques ; Crochemore, Maxime
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986), p. 441-456 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1986-01-01
@article{ITA_1986__20_4_441_0,
     author = {Hebrard, Jean-Jacques and Crochemore, Maxime},
     title = {Calcul de la distance par les sous-mots},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {20},
     year = {1986},
     pages = {441-456},
     mrnumber = {880846},
     zbl = {0639.68063},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/ITA_1986__20_4_441_0}
}

Hebrard, Jean-Jacques; Crochemore, Maxime. Calcul de la distance par les sous-mots. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986) pp. 441-456. http://gdmltest.u-ga.fr/item/ITA_1986__20_4_441_0/

AHU 74. A. V. Aho, J. E. Hopcroft et J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974. | MR 413592 | Zbl 0326.68005

CC 82. A. Cardon et M. Crochemore, Partitioning a graph in O ( | A | log2 | V | ), Theor. Comput. Sci. vol. 19, 1982, p. 85-98. | MR 664414 | Zbl 0478.68067

He 84. J. J. Hebrard, Distances sur les mots. Application à la recherche de motifs, Thèse de 3e cycle, Université de Haute-Normandie, 1984.

Hi 77. D. S. Hirschberg, Algorithmes for the Longest Common Subsequence Problem, J. Assoc. Comput. Mach., vol. 24, 1977, p. 664-675. | MR 461985 | Zbl 0402.68041

HS 77. J. W. Hunt et T. G. Szymanski, A Fast Algorithm for Computing Longest Common Subsequences, Comm. ACM., vol. 20, 1977, p. 350-353. | MR 436655 | Zbl 0354.68078

Lo 82. Lothaire, Combinatorics on Words, Addition-Wesley, Reading, Mass., 1982. | Zbl 0514.20045

Mo 70 H. L. Morgan, Spelling Correction in Systems Programs, Comm. ACM., vol. 13, 1970, p. 90-94. | Zbl 0185.43403

M P 80. W. J. Masek et M. S. Paterson, A Faster Algorithm Computing String Edit Distances, J. Comput. and Sys. Sci., vol. 20, 1980, p. 18-31. | MR 566639 | Zbl 0436.68044

NKY 82. N. Nakatsu, Y. Kambayashi et S. Yajima, A Longest Common Subsequence Algorithm Suitable for Similar Test Strings, Acta Informatica, vol. 18, 1982, p. 171-179. | MR 687701 | Zbl 0493.68041

Se 74. P. H. Sellers, An Algorithm for the Distance between two Finite Sequences, J. Combinatorial Theory, Series A, vol. 16, 1974, p. 253-258. | MR 342404 | Zbl 0273.05015

Si 84. I. Simon, An Algorithm to Distingsh Words Efficiently by their Subwords Communication at "Combinatorial Algorithms on words" conference Maratea(1984).

SK 83. D. Sankoff et J. B. Kruskal, Time Warps, String Edits, and Macromolecules : the Theory and Practice of Sequence Comparison, Addison-Wesley, Reading, Mass., 1983. | MR 726027

WF. 74. R. A. Wagner et M. J. Fischer, The String to String Correction Problem, J. Assoc. Comput. Mach., vol. 21, 1974, p. 168-173. | MR 356576 | Zbl 0278.68032