Calcul de la distance par les sous-mots
RAIRO-Theor. Inf. Appl., 20 4 (1986) 441-456
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Finite automata based algorithms on subsequences and supersequences of degenerate strings
Costas Iliopoulos, M. Sohel Rahman, Michal Voráček and Ladislav VagnerJournal of Discrete Algorithms 8 (2) 117 (2010)
https://doi.org/10.1016/j.jda.2008.10.004
Directed acyclic subsequence graph—Overview
Maxime Crochemore, Bořivoj Melichar and Zdeněk Tronı́čekJournal of Discrete Algorithms 1 (3-4) 255 (2003)
https://doi.org/10.1016/S1570-8667(03)00029-7
Implementation and Application of Automata
Bořivoj Melichar and Tomáš PolcarLecture Notes in Computer Science, Implementation and Application of Automata 2759 294 (2003)
https://doi.org/10.1007/3-540-45089-0_27
String Processing and Information Retrieval
Maxime Crochemore and Zdeněk TroníčekLecture Notes in Computer Science, String Processing and Information Retrieval 2476 58 (2002)
https://doi.org/10.1007/3-540-45735-6_6
An algorithm for distinguishing efficiently bit-strings by their subsequences
Jean-Jacques HebrardTheoretical Computer Science 82 (1) 35 (1991)
https://doi.org/10.1016/0304-3975(91)90170-7
Searching subsequences
Ricardo A. Baeza-YatesTheoretical Computer Science 78 (2) 363 (1991)
https://doi.org/10.1016/0304-3975(91)90358-9