205 related articles for article (PubMed ID: 15838146)
1. DNA sequence compression using the burrows-wheeler transform.
Adjeroh D; Zhang Y; Mukherjee A; Powell M; Bell T
Proc IEEE Comput Soc Bioinform Conf; 2002; 1():303-13. PubMed ID: 15838146
[TBL] [Abstract][Full Text] [Related]
2. New method for yeast identification using Burrows-Wheeler transform.
Pokrzywa R
J Bioinform Comput Biol; 2008 Apr; 6(2):403-13. PubMed ID: 18464330
[TBL] [Abstract][Full Text] [Related]
3. Application of the Burrows-Wheeler Transform for searching for tandem repeats in DNA sequences.
Pokrzywa R
Int J Bioinform Res Appl; 2009; 5(4):432-46. PubMed ID: 19640830
[TBL] [Abstract][Full Text] [Related]
4. Compression of Multiple DNA Sequences Using Intra-Sequence and Inter-Sequence Similarities.
Cheng KO; Wu P; Law NF; Siu WC
IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(6):1322-32. PubMed ID: 26671804
[TBL] [Abstract][Full Text] [Related]
5. Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform.
Cox AJ; Bauer MJ; Jakobi T; Rosone G
Bioinformatics; 2012 Jun; 28(11):1415-9. PubMed ID: 22556365
[TBL] [Abstract][Full Text] [Related]
6. Using GPUs for the exact alignment of short-read genetic sequences by means of the Burrows-Wheeler transform.
Salavert Torres J; Blanquer Espert I; Domínguez AT; Hernández García V; Medina Castelló I; Tárraga Giménez J; Dopazo Blázquez J
IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1245-56. PubMed ID: 22450827
[TBL] [Abstract][Full Text] [Related]
7. Compressed pattern matching in DNA sequences.
Chen L; Lu S; Ram J
Proc IEEE Comput Syst Bioinform Conf; 2004; ():62-8. PubMed ID: 16448000
[TBL] [Abstract][Full Text] [Related]
8. A top-down linguistic approach to the analysis of genomic sequences: The metabotropic glutamate receptors 1 and 5 in human and in mouse as a case study.
Menconi G; Puliti A; Sbrana I; Conti V; Marangoni R
J Theor Biol; 2011 Feb; 270(1):134-42. PubMed ID: 21093453
[TBL] [Abstract][Full Text] [Related]
9. Iterative dictionary construction for compression of large DNA data sets.
Kuruppu S; Beresford-Smith B; Conway T; Zobel J
IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(1):137-49. PubMed ID: 21576758
[TBL] [Abstract][Full Text] [Related]
10. Parallel Computation of the Burrows-Wheeler Transform of Short Reads Using Prefix Parallelism.
Kimura K; Koike A
IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(1):3-13. PubMed ID: 29994538
[TBL] [Abstract][Full Text] [Related]
11. An improved heuristic algorithm for finding motif signals in DNA sequences.
Huang CW; Lee WS; Hsieh SY
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):959-75. PubMed ID: 20855921
[TBL] [Abstract][Full Text] [Related]
12. FRESCO: Referential compression of highly similar sequences.
Wandelt S; Leser U
IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(5):1275-88. PubMed ID: 24524158
[TBL] [Abstract][Full Text] [Related]
13. CoGI: Towards Compressing Genomes as an Image.
Xie X; Zhou S; Guan J
IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(6):1275-85. PubMed ID: 26671800
[TBL] [Abstract][Full Text] [Related]
14. GATA: a graphic alignment tool for comparative sequence analysis.
Nix DA; Eisen MB
BMC Bioinformatics; 2005 Jan; 6():9. PubMed ID: 15655071
[TBL] [Abstract][Full Text] [Related]
15. Compression of annotated nucleotide sequences.
Korodi G; Tabus I
IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(3):447-457. PubMed ID: 17666764
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. Parallel and Space-Efficient Construction of Burrows-Wheeler Transform and Suffix Array for Big Genome Data.
Liu Y; Hankeln T; Schmidt B
IEEE/ACM Trans Comput Biol Bioinform; 2016; 13(3):592-8. PubMed ID: 27295644
[TBL] [Abstract][Full Text] [Related]
18. Text compression using hybrids of BWT and GBAM.
Al-Nassiri A
Int J Neural Syst; 2003 Feb; 13(1):39-45. PubMed ID: 12638122
[TBL] [Abstract][Full Text] [Related]
19. Modified HuffBit Compress Algorithm - An Application of R.
Habib N; Ahmed K; Jabin I; Rahman MM
J Integr Bioinform; 2018 Feb; 15(3):. PubMed ID: 29470175
[TBL] [Abstract][Full Text] [Related]
20. How does DNA sequence motif discovery work?
D'haeseleer P
Nat Biotechnol; 2006 Aug; 24(8):959-61. PubMed ID: 16900144
[No Abstract] [Full Text] [Related]
[Next] [New Search]
