Calcul de la distance par les sous-mots

Jean-Jacques Hebrard; Maxime Crochemore

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1986)

  • Volume: 20, Issue: 4, page 441-456
  • ISSN: 0988-3754

How to cite

top

Hebrard, Jean-Jacques, and Crochemore, Maxime. "Calcul de la distance par les sous-mots." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 20.4 (1986): 441-456. <http://eudml.org/doc/92270>.

@article{Hebrard1986,
author = {Hebrard, Jean-Jacques, Crochemore, Maxime},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {shortest subsequence; words; automata; data structures},
language = {fre},
number = {4},
pages = {441-456},
publisher = {EDP-Sciences},
title = {Calcul de la distance par les sous-mots},
url = {http://eudml.org/doc/92270},
volume = {20},
year = {1986},
}

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
PB - EDP-Sciences
VL - 20
IS - 4
SP - 441
EP - 456
LA - fre
KW - shortest subsequence; words; automata; data structures
UR - http://eudml.org/doc/92270
ER -

References

top
  1. AHU 74. A. V. AHO, J. E. HOPCROFT et J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974. Zbl0326.68005MR413592
  2. CC 82. A. CARDON et M. CROCHEMORE, Partitioning a graph in O ( | A | log2 | V | ), Theor. Comput. Sci. vol. 19, 1982, p. 85-98. Zbl0478.68067MR664414
  3. He 84. J. J. HEBRARD, Distances sur les mots. Application à la recherche de motifs, Thèse de 3e cycle, Université de Haute-Normandie, 1984. 
  4. Hi 77. D. S. HIRSCHBERG, Algorithmes for the Longest Common Subsequence Problem, J. Assoc. Comput. Mach., vol. 24, 1977, p. 664-675. Zbl0402.68041MR461985
  5. 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. Zbl0354.68078MR436655
  6. Lo 82. LOTHAIRE, Combinatorics on Words, Addition-Wesley, Reading, Mass., 1982. Zbl0514.20045
  7. Mo 70 H. L. MORGAN, Spelling Correction in Systems Programs, Comm. ACM., vol. 13, 1970, p. 90-94. Zbl0185.43403
  8. 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. Zbl0436.68044MR566639
  9. 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. Zbl0493.68041MR687701
  10. 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. Zbl0273.05015MR342404
  11. Si 84. I. SIMON, An Algorithm to Distingsh Words Efficiently by their Subwords Communication at "Combinatorial Algorithms on words" conference Maratea(1984). 
  12. 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. MR726027
  13. 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. Zbl0278.68032MR356576

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.