A fast algorithm for the all-pairs suffix-prefix problem
type: Item
instance of: scholarly article
title: A fast algorithm for the all-pairs suffix-prefix problem
zbMATH Open document ID: 1380.68479
author: Jihyuk Lim
author: Kunsoo Park
published in: Theoretical Computer Science
publication date: 2017-11-06T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 92D20
zbMATH DE Number: 6803095
zbMATH Keywords: all-pairs suffix-prefix problem
zbMATH Keywords: algorithm engineering
zbMATH Keywords: DNA sequence assembly
describes a project that uses: Readjoiner
MaRDI profile type: Publication
full work available at URL: j.tcs.2017.07.013
OpenAlex ID: W2738126475
cites work: An efficient algorithm for the all pairs suffix-prefix problem
cites work: Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
cites work: Replacing suffix trees with enhanced suffix arrays
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: An improved algorithm for the all-pairs suffix-prefix problem
cites work: Parallel computation for the all-pairs suffix-prefix problem
cites work: Algorithms on Strings, Trees and Sequences
cites work: Efficient string matching
cites work: A fast string searching algorithm
cites work: Fast practical multi-pattern matching
DOI: 10.1016/J.TCS.2017.07.013
Recommended article: Q4858442
Recommended article: An efficient algorithm for the all pairs suffix-prefix problem
Recommended article: An improved algorithm for the all-pairs suffix-prefix problem
Recommended article: All-pairs suffix/prefix in optimal time using Aho-Corasick space
Recommended article: Parallel computation for the all-pairs suffix-prefix problem
Recommended article: Q4580161
Recommended article: A Fast Suffix-Sorting Algorithm
Recommended article: Parallel Suffix–Prefix-Matching Algorithm and Applications
Recommended article: An elegant algorithm for the construction of suffix arrays
description: scientific article; zbMATH DE number 6803095