Algorithm engineering for all-pairs suffix-prefix matching

DOI10.4230/LIPICS.SEA.2017.14MaRDI QIDQ4580161zbMATH OpenFDO

Authors Jihyuk Lim, Kunsoo Park

Publication date 13 August 2018

Full work available at URL https://doi.org/10.4230/LIPICS.SEA.2017.14

zbMATH Keywords

algorithm engineeringall-pairs suffix-prefix matchingDNA sequence assembly

Mathematics Subject Classification ID

Algorithms on strings (68W32) Computational methods for problems pertaining to biology (92-08) Protein sequences, DNA sequences (92D20)

Recommendations

• A fast algorithm for the all-pairs suffix-prefix problem
• An improved algorithm for the all-pairs suffix-prefix problem
• Parallel computation for the all-pairs suffix-prefix problem
• An efficient algorithm for the all pairs suffix-prefix problem
• scientific article; zbMATH DE number 826056

Cited in

(7)

• An efficient algorithm for the all pairs suffix-prefix problem
• A fast algorithm for the all-pairs suffix-prefix problem
• Parallel computation 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
• Approximate All-Pairs Suffix/Prefix Overlaps
• scientific article; zbMATH DE number 826056 (Why is no real title available?)

This page was built for publication: Algorithm engineering for all-pairs suffix-prefix matching

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