Free Access
RAIRO-Theor. Inf. Appl.
Volume 20, Number 4, 1986
Page(s) 441 - 456
Published online 01 February 2017
  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. [MR: 413592] [Zbl: 0326.68005] [Google Scholar]
  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. [MR: 664414] [Zbl: 0478.68067] [Google Scholar]
  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. [Google Scholar]
  4. 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] [Google Scholar]
  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. [MR: 436655] [Zbl: 0354.68078] [Google Scholar]
  6. Lo 82. LOTHAIRE, Combinatorics on Words, Addition-Wesley, Reading, Mass., 1982. [Zbl: 0514.20045] [Google Scholar]
  7. Mo 70 H. L. MORGAN, Spelling Correction in Systems Programs, Comm. ACM., vol. 13, 1970, p. 90-94. [Zbl: 0185.43403] [Google Scholar]
  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. [MR: 566639] [Zbl: 0436.68044] [Google Scholar]
  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. [MR: 687701] [Zbl: 0493.68041] [Google Scholar]
  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. [MR: 342404] [Zbl: 0273.05015] [Google Scholar]
  11. Si 84. I. SIMON, An Algorithm to Distingsh Words Efficiently by their Subwords Communication at "Combinatorial Algorithms on words" conference Maratea(1984). [Google Scholar]
  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. [MR: 726027] [Google Scholar]
  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. [MR: 356576] [Zbl: 0278.68032] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.