Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem (Q990128)

From MaRDI portal
Revision as of 02:50, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
scientific article

    Statements

    Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem (English)
    0 references
    0 references
    0 references
    2 September 2010
    0 references
    0 references
    algorithms
    0 references
    suffix array
    0 references
    suffix-prefix matching
    0 references