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:

Calcul de la distance par les sous-mots

Jean-Jacques Hebrard, Maxime Crochemore

RAIRO-Theor. Inf. Appl., 20 4 (1986) 441-456

Published online: 2017-02-01

DOI: https://doi.org/10.1051/ita/1986200404411

This article has been cited by the following article(s):

Searching subsequences

Ricardo A. Baeza-Yates
Theoretical Computer Science 78 (2) 363 (1991)
DOI: 10.1016/0304-3975(91)90358-9
See this article

An algorithm for distinguishing efficiently bit-strings by their subsequences

Jean-Jacques Hebrard
Theoretical Computer Science 82 (1) 35 (1991)
DOI: 10.1016/0304-3975(91)90170-7
See this article

Maxime Crochemore and Zdeněk Troníček
2476 58 (2002)
DOI: 10.1007/3-540-45735-6_6
See this article

Finite automata based algorithms on subsequences and supersequences of degenerate strings

Costas Iliopoulos, M. Sohel Rahman, Michal Voráček and Ladislav Vagner
Journal of Discrete Algorithms 8 (2) 117 (2010)
DOI: 10.1016/j.jda.2008.10.004
See this article

Directed acyclic subsequence graph—Overview

Maxime Crochemore, Bořivoj Melichar and Zdeněk Tronı́ček
Journal of Discrete Algorithms 1 (3-4) 255 (2003)
DOI: 10.1016/S1570-8667(03)00029-7
See this article

Bořivoj Melichar and Tomáš Polcar
2759 294 (2003)
DOI: 10.1007/3-540-45089-0_27
See this article