Geodesic
Calcul de la distance par les sous-mots
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986) no. 4, pp. 441-456.

Voir la notice de l'article provenant de la source Numdam

@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},
     pages = {441--456},
     publisher = {AFCET - Gauthier-Villars},
     address = {Paris},
     volume = {20},
     number = {4},
     year = {1986},
     mrnumber = {880846},
     zbl = {0639.68063},
     language = {fr},
     url = {http://geodesic.mathdoc.fr/item/ITA_1986__20_4_441_0/}
}
TY  - JOUR
AU  - Hebrard, Jean-Jacques
AU  - Crochemore, Maxime
TI  - Calcul de la distance par les sous-mots
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1986
SP  - 441
EP  - 456
VL  - 20
IS  - 4
PB  - AFCET - Gauthier-Villars
PP  - Paris
UR  - http://geodesic.mathdoc.fr/item/ITA_1986__20_4_441_0/
LA  - fr
ID  - ITA_1986__20_4_441_0
ER  - 
%0 Journal Article
%A Hebrard, Jean-Jacques
%A Crochemore, Maxime
%T Calcul de la distance par les sous-mots
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1986
%P 441-456
%V 20
%N 4
%I AFCET - Gauthier-Villars
%C Paris
%U http://geodesic.mathdoc.fr/item/ITA_1986__20_4_441_0/
%G fr
%F 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) no. 4, pp. 441-456. http://geodesic.mathdoc.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. | Zbl | MR

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

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. | Zbl | MR

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. | Zbl | MR

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

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

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. | Zbl | MR

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. | Zbl | MR

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. | Zbl | MR

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

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. | Zbl | MR