An inexact-suffix-tree-based algorithm for detecting extensible patterns

From MaRDI portal

(Redirected from An inexact-suffix-tree-based algorithm for detecting extensible patterns)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=An_inexact-suffix-tree-based_algorithm_for_detecting_extensible_patterns&oldid=71248647"