144 related articles for article (PubMed ID: 29795706)
1. 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]
2. 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]
3. Storage and retrieval of highly repetitive sequence collections.
Mäkinen V; Navarro G; Sirén J; Välimäki N
J Comput Biol; 2010 Mar; 17(3):281-308. PubMed ID: 20377446
[TBL] [Abstract][Full Text] [Related]
4. 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]
5. Compressed suffix tree--a basis for genome-scale sequence analysis.
Välimäki N; Gerlach W; Dixit K; Mäkinen V
Bioinformatics; 2007 Mar; 23(5):629-30. PubMed ID: 17237063
[TBL] [Abstract][Full Text] [Related]
6. 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]
7. Indexing huge genome sequences for solving various problems.
Sadakane K; Shibuya T
Genome Inform; 2001; 12():175-83. PubMed ID: 11791236
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. 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]
10. A space and time-efficient index for the compacted colored de Bruijn graph.
Almodaresi F; Sarkar H; Srivastava A; Patro R
Bioinformatics; 2018 Jul; 34(13):i169-i177. PubMed ID: 29949982
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. The generalised k-Truncated Suffix Tree for time-and space-efficient searches in multiple DNA or protein sequences.
Schulz MH; Bauer S; Robinson PN
Int J Bioinform Res Appl; 2008; 4(1):81-95. PubMed ID: 18283030
[TBL] [Abstract][Full Text] [Related]
13. 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]
14. Toward optimizing the cache performance of suffix trees for sequence analysis algorithms suffix tree cache performance optimization.
Lee C; Huang CH
Adv Exp Med Biol; 2010; 680():411-7. PubMed ID: 20865526
[TBL] [Abstract][Full Text] [Related]
15. PTPan--overcoming memory limitations in oligonucleotide string matching for primer/probe design.
Eissler T; Hodges CP; Meier H
Bioinformatics; 2011 Oct; 27(20):2797-805. PubMed ID: 21856736
[TBL] [Abstract][Full Text] [Related]
16. SplitMEM: a graphical algorithm for pan-genome analysis with suffix skips.
Marcus S; Lee H; Schatz MC
Bioinformatics; 2014 Dec; 30(24):3476-83. PubMed ID: 25398610
[TBL] [Abstract][Full Text] [Related]
17. Distributed hybrid-indexing of compressed pan-genomes for scalable and fast sequence alignment.
Maarala AI; Arasalo O; Valenzuela D; Mäkinen V; Heljanko K
PLoS One; 2021; 16(8):e0255260. PubMed ID: 34343181
[TBL] [Abstract][Full Text] [Related]
18. An efficient and extensible approach for compressing phylogenetic trees.
Matthews SJ; Williams TL
BMC Bioinformatics; 2011 Oct; 12 Suppl 10(Suppl 10):S16. PubMed ID: 22165819
[TBL] [Abstract][Full Text] [Related]
19. Parallel continuous flow: a parallel suffix tree construction tool for whole genomes.
Comin M; Farreras M
J Comput Biol; 2014 Apr; 21(4):330-44. PubMed ID: 24597675
[TBL] [Abstract][Full Text] [Related]
20. Efficient maximal repeat finding using the burrows-wheeler transform and wavelet tree.
Külekci MO; Vitter JS; Xu B
IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(2):421-9. PubMed ID: 21968959
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
