scientific article; zbMATH DE number 826056

MaRDI QIDQ4858442zbMATH OpenFDO

Authors Gad M. Landau, Baruch Schieber, Dan Gusfield

Publication date 13 December 1995

zbMATH Keywords

algorithmsuffix-prefix match

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Parallel algorithms in computer science (68W10) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• An efficient algorithm for the all pairs suffix-prefix problem
• Least random suffix/prefix matches in output-sensitive time
• An improved algorithm for the all-pairs suffix-prefix problem
• A fast algorithm for the all-pairs suffix-prefix problem
• Algorithm engineering for all-pairs suffix-prefix matching

Cited in

(8)

• An efficient algorithm for the all pairs suffix-prefix problem
• Sublinear approximate string matching and biological applications
• A fast algorithm for the all-pairs suffix-prefix problem
• All-pairs suffix/prefix in optimal time using Aho-Corasick space
• An improved algorithm for the all-pairs suffix-prefix problem
• Least random suffix/prefix matches in output-sensitive time
• Approximate All-Pairs Suffix/Prefix Overlaps
• Algorithm engineering for all-pairs suffix-prefix matching

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4858442)