The longest common extension problem revisited and applications to approximate string searching (Q616995)

From MaRDI portal
Revision as of 16:03, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
The longest common extension problem revisited and applications to approximate string searching
scientific article

    Statements

    The longest common extension problem revisited and applications to approximate string searching (English)
    0 references
    0 references
    0 references
    0 references
    20 January 2011
    0 references
    longest common extension
    0 references
    approximate string search
    0 references
    Landau-Vishkin algorithm
    0 references
    Ukkonen's cutoff algorithm
    0 references

    Identifiers