Pages that link to "Item:Q1190509"
From MaRDI portal
The following pages link to An efficient algorithm for the all pairs suffix-prefix problem (Q1190509):
Displayed 18 items.
- Linear-size suffix tries (Q294967) (← links)
- Recognition of overlap graphs (Q405660) (← links)
- 2D Lyndon words and applications (Q513297) (← links)
- Optimal prefix and suffix queries on texts (Q975480) (← links)
- Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem (Q990128) (← links)
- On updating suffix tree labels (Q1129015) (← links)
- A \(2_3^2\) superstring approximation algorithm (Q1281759) (← links)
- Faster implementation of a shortest superstring approximation (Q1336759) (← links)
- A fast algorithm for the all-pairs suffix-prefix problem (Q1676303) (← links)
- Combinatorial algorithms for DNA sequence assembly (Q1902464) (← links)
- All-pairs suffix/prefix in optimal time using Aho-Corasick space (Q2169425) (← links)
- Hierarchical overlap graph (Q2281159) (← links)
- Distributed suffix trees (Q2569396) (← links)
- An improved algorithm for the all-pairs suffix-prefix problem (Q2628805) (← links)
- A linear time algorithm for shortest cyclic cover of strings (Q2628807) (← links)
- Superstring Graph: A New Approach for Genome Assembly (Q2830057) (← links)
- Improved length bounds for the shortest superstring problem (Q5057460) (← links)
- (Q5090335) (← links)