An efficient algorithm for the all pairs suffix-prefix problem (Q1190509): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Parallel construction of a suffix tree with applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Pattern Matching in Strings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Space-Economical Suffix Tree Construction Algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A greedy approximation algorithm for constructing shortest common superstrings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4010349 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation algorithms for the shortest common superstring problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A linear-time algorithm for finding approximate shortest common superstrings / rank | |||
Normal rank |
Revision as of 11:45, 16 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An efficient algorithm for the all pairs suffix-prefix problem |
scientific article |
Statements
An efficient algorithm for the all pairs suffix-prefix problem (English)
0 references
26 September 1992
0 references
string matching
0 references
suffix-prefix match
0 references