118 related articles for article (PubMed ID: 38832320)
1. 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]
2. 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]
3. 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]
4. 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]
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. Wheeler graphs: A framework for BWT-based data structures.
Gagie T; Manzini G; Sirén J
Theor Comput Sci; 2017 Oct; 698():67-78. PubMed ID: 29276331
[TBL] [Abstract][Full Text] [Related]
7. 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]
8. 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]
9. 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]
10. 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]
11. 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]
12. 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]
13. 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]
14. Error Tree: A Tree Structure for Hamming and Edit Distances and Wildcards Matching.
Al-Okaily A
J Comput Biol; 2015 Dec; 22(12):1118-28. PubMed ID: 26402070
[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. A space-efficient construction of the Burrows-Wheeler transform for genomic data.
Lippert RA; Mobarry CM; Walenz BP
J Comput Biol; 2005 Sep; 12(7):943-51. PubMed ID: 16201914
[TBL] [Abstract][Full Text] [Related]
17. Graphical pan-genome analysis with compressed suffix trees and the Burrows-Wheeler transform.
Baier U; Beller T; Ohlebusch E
Bioinformatics; 2016 Feb; 32(4):497-504. PubMed ID: 26504144
[TBL] [Abstract][Full Text] [Related]
18. Exploring efficient grouping algorithms in regular expression matching.
Xu C; Su J; Chen S
PLoS One; 2018; 13(10):e0206068. PubMed ID: 30356262
[TBL] [Abstract][Full Text] [Related]
19. Derivatives of tree sets with applications to grammatical inference.
Levine B
IEEE Trans Pattern Anal Mach Intell; 1981 Mar; 3(3):285-93. PubMed ID: 21868949
[TBL] [Abstract][Full Text] [Related]
20. Two Efficient Techniques to Find Approximate Overlaps between Sequences.
Haj Rachid M
Biomed Res Int; 2017; 2017():2731385. PubMed ID: 28293632
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
