139 related articles for article (PubMed ID: 32973918)
1. gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections.
Louza FA; Telles GP; Gog S; Prezza N; Rosone G
Algorithms Mol Biol; 2020; 15():18. PubMed ID: 32973918
[TBL] [Abstract][Full Text] [Related]
2. Generalized enhanced suffix array construction in external memory.
Louza FA; Telles GP; Hoffmann S; Ciferri CDA
Algorithms Mol Biol; 2017; 12():26. PubMed ID: 29234460
[TBL] [Abstract][Full Text] [Related]
3. External memory BWT and LCP computation for sequence collections with applications.
Egidi L; Louza FA; Manzini G; Telles GP
Algorithms Mol Biol; 2019; 14():6. PubMed ID: 30899322
[TBL] [Abstract][Full Text] [Related]
4. mkESA: enhanced suffix array construction tool.
Homann R; Fleer D; Giegerich R; Rehmsmeier M
Bioinformatics; 2009 Apr; 25(8):1084-5. PubMed ID: 19246510
[TBL] [Abstract][Full Text] [Related]
5. Suffix sorting via matching statistics.
Lipták Z; Masillo F; Puglisi SJ
Algorithms Mol Biol; 2024 Mar; 19(1):11. PubMed ID: 38475889
[TBL] [Abstract][Full Text] [Related]
6. Fast, parallel, and cache-friendly suffix array construction.
Khan J; Rubel T; Molloy E; Dhulipala L; Patro R
Algorithms Mol Biol; 2024 Apr; 19(1):16. PubMed ID: 38679714
[TBL] [Abstract][Full Text] [Related]
7. Multithread Multistring Burrows-Wheeler Transform and Longest Common Prefix Array.
Bonizzoni P; Della Vedova G; Pirola Y; Previtali M; Rizzi R
J Comput Biol; 2019 Sep; 26(9):948-961. PubMed ID: 31140836
[No Abstract] [Full Text] [Related]
8. Computing matching statistics on Wheeler DFAs.
Conte A; Cotumaccio N; Gagie T; Manzini G; Prezza N; Sciortino M
Proc Data Compress Conf; 2023 Mar; 2023():150-159. PubMed ID: 38832320
[TBL] [Abstract][Full Text] [Related]
9. Breaking the
Kempa D; Kociumaka T
Proc Annu ACM SIAM Symp Discret Algorithms; 2023; 2023():5122-5202. PubMed ID: 38835617
[TBL] [Abstract][Full Text] [Related]
10. r-indexing the eBWT.
Boucher C; Cenzato D; Lipták Z; Rossi M; Sciortino M
Int Symp String Process Inf Retr; 2021 Oct; 12944():3-12. PubMed ID: 38742018
[TBL] [Abstract][Full Text] [Related]
11. PFP Compressed Suffix Trees.
Boucher C; Cvacho O; Gagie T; Holub J; Manzini G; Navarro G; Rossi M
Proc Worksh Algorithm Eng Exp; 2021; 2021():60-72. PubMed ID: 35355938
[TBL] [Abstract][Full Text] [Related]
12. Computing the original eBWT faster, simpler, and with less memory.
Boucher C; Cenzato D; Lipták Z; Rossi M; Sciortino M
Int Symp String Process Inf Retr; 2021 Oct; 12944():129-142. PubMed ID: 38742019
[TBL] [Abstract][Full Text] [Related]
13. An Elegant Algorithm for the Construction of Suffix Arrays.
Rajasekaran S; Nicolae M
J Discrete Algorithms (Amst); 2014 Jul; 27():21-28. PubMed ID: 25045344
[TBL] [Abstract][Full Text] [Related]
14. Document retrieval on repetitive string collections.
Gagie T; Hartikainen A; Karhu K; Kärkkäinen J; Navarro G; Puglisi SJ; Sirén J
Inf Retr Boston; 2017; 20(3):253-291. PubMed ID: 28596702
[TBL] [Abstract][Full Text] [Related]
15. Recursive Prefix-Free Parsing for Building Big BWTs.
Oliva M; Gagie T; Boucher C
bioRxiv; 2023 Jan; ():. PubMed ID: 36712109
[TBL] [Abstract][Full Text] [Related]
16. Bitpacking techniques for indexing genomes: II. Enhanced suffix arrays.
Wu TD
Algorithms Mol Biol; 2016; 11():9. PubMed ID: 27110277
[TBL] [Abstract][Full Text] [Related]
17. A bioinformatician's guide to the forefront of suffix array construction algorithms.
Shrestha AM; Frith MC; Horton P
Brief Bioinform; 2014 Mar; 15(2):138-54. PubMed ID: 24413184
[TBL] [Abstract][Full Text] [Related]
18. Using the Sadakane compressed suffix tree to solve the all-pairs suffix-prefix problem.
Rachid MH; Malluhi Q; Abouelhoda M
Biomed Res Int; 2014; 2014():745298. PubMed ID: 24834435
[TBL] [Abstract][Full Text] [Related]
19. Merging of multi-string BWTs with applications.
Holt J; McMillan L
Bioinformatics; 2014 Dec; 30(24):3524-31. PubMed ID: 25172922
[TBL] [Abstract][Full Text] [Related]
20. Relative Suffix Trees.
Farruggia A; Gagie T; Navarro G; Puglisi SJ; Sirén J
Comput J; 2018 May; 61(5):773-788. PubMed ID: 29795706
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
