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 7 items.
- 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)
- Combinatorial algorithms for DNA sequence assembly (Q1902464) (← links)
- Distributed suffix trees (Q2569396) (← links)