Compressing DNA sequence databases with coil

BMC Bioinformatics

Volumn 9, Issue , 2008, Pages

  White, W Timothy J ^a   Hendy, Michael D ^a  

^a MASSEY UNIVERSITY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

DATA-COMMUNICATION; DNA SEQUENCE DATABASE; EXPONENTIAL RATES; EXPRESSED SEQUENCE TAGS; HIGH COMPRESSION RATIO; NARROW DISTRIBUTION; PORTABLE SOFTWARE; SEQUENCE DATABASE;

DATABASE SYSTEMS; DIGITAL STORAGE; DNA SEQUENCES; GENES;

DATA COMPRESSION;

DNA;

ARTICLE; BIOINFORMATICS; COMPUTER MEMORY; COMPUTER PROGRAM; DNA SEQUENCE; EXPRESSED SEQUENCE TAG; GENBANK; INFORMATION PROCESSING; PROCESS DESIGN; SEQUENCE DATABASE; ANIMAL; ARTIFICIAL NEURAL NETWORK; DATA BASE; HUMAN; METHODOLOGY; MOLECULAR EVOLUTION; NUCLEIC ACID DATABASE; PHYLOGENY; POINT MUTATION; SPECIES DIFFERENCE;

ANIMALS; DATA COMPRESSION; DATABASE MANAGEMENT SYSTEMS; DATABASES, NUCLEIC ACID; EVOLUTION, MOLECULAR; EXPRESSED SEQUENCE TAGS; HUMANS; NEURAL NETWORKS (COMPUTER); PHYLOGENY; POINT MUTATION; SEQUENCE ANALYSIS, DNA; SPECIES SPECIFICITY;

EID: 45249110222     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-9-242     Document Type: Article

References (38)

1. NCBI NCBI-GenBank Flat File Release 159 Release Notes ftp://ftp.ncbi.nih.gov/genbank/release.notes/gb159.release.notes
2. NCBI News GenBank Passes the 100 Gigabase Mark NCBI News Benson D and Wheeler D http://www.ncbi.nlm.nih.gov/Web/Newsltr/V14N2/100gig.html
3. Ziv J Lempel A Universal Algorithm for Sequential Data Compression IEEE Transactions on Information Theory 1977 23 337-343
4. Gailly J Adler M gzip (GNU zip) compression utility http://www.gnu.org/ software/gzip/
5. Matsumoto T Sadakane K Imai H Biological sequence compression algorithms: December 18-19; Tokyo. Universal Academy Press 2000 43-52
6. Grumbach S Tahi F Compression of DNA sequences: 30 March-2 April; Snowbird, Utah. IEEE Computer Society Press Storer JA and Cohn M 1993 340-350
7. Grumbach S Tahi F A New Challenge for Compression Algorithms - Genetic Sequences Inf Process Manage 1994 30 875-886
8. Chen X Kwong S Li M A compression algorithm for DNA sequences IEEE Engineering in Medicine and Biology Magazine 2001 20 61-66
9. Chen X Li M Ma B Tromp J DNACompress: Fast and effective DNA sequence compression Bioinformatics 2002 18 1696-1698 12490460
10. Li M Badger JH Chen X Kwong S Kearney P Zhang HY An information-based sequence distance and its application to whole mitochondrial genome phylogeny Bioinformatics 2001 17 149-154 11238070
11. Kocsor A Kertesz-Farkas A Kajan L Pongor S Application of compression-based distance measures to protein sequence classification: a methodological study Bioinformatics 2006 22 407-412 16317070
12. Ma B Tromp J Li M PatternHunter: Faster and more sensitive homology search Bioinformatics 2002 18 440-445 11934743
13. Strelets VB Lim HA Compression of Protein-Sequence Databases Comput Appl Biosci 1995 11 557-561 8590180
14. Wu CH Yeh LSL Huang HZ Arminski L Castro-Alvear J Chen YX Hu ZZ Kourtesis P Ledley RS Suzek BE Vinayaka CR Zhang J Barker WC The Protein Information Resource Nucleic Acids Res 2003 31 345-347 165487 12520019
15. Katz P PKZIP Milwaukee, WI, USA, PKWARE, Inc. 1.1 1990 http://www.pkware.com/
16. Li WZ Jaroszewski L Godzik A Clustering of highly homologous sequences to reduce the size of large protein databases Bioinformatics 2001 17 282-283 11294794
17. Li WZ Jaroszewski L Godzik A Tolerating some redundancy significantly speeds up clustering of large protein databases Bioinformatics 2002 18 77-82 11836214
18. Li WZ Godzik A Cd-hit: A fast program for clustering and comparing large sets of protein or nucleotide sequences Bioinformatics 2006 22 1658-1659 16731699
19. nrdb http://blast.wustl.edu/pub/nrdb/
20. Thompson JD Higgins DG Gibson TJ Clustal-W - Improving the Sensitivity of Progressive Multiple Sequence Alignment through Sequence Weighting, Position-Specific Gap Penalties and Weight Matrix Choice Nucleic Acids Res 1994 22 4673-4680 308517 7984417
21. Foulds LR Graham RL The Steiner problem in phylogeny is NP-complete Advances in Applied Mathematics 1982 3 43-49
22. Chazelle B A minimum spanning tree algorithm with Inverse Ackermann type complexity Journal of the ACM 2000 47 1028-1047
23. Ferragina P Manzini G Indexing compressed text J ACM 2005 52 552-581
24. Russo LMS Oliveira AL A compressed self-index using a Ziv-Lempel dictionary String Processing and Information Retrieval, Proceedings Berlin, SPRINGER-VERLAG BERLIN Lecture Notes in Computer Science 2006 4209 163-180
25. Foschini L Grossi R Gupta A Vitter JS When indexing equals compression: Experiments with compressing suffix arrays and applications ACM Trans Algorithms 2006 2 611-639
26. Lipman DJ Pearson WR Rapid and Sensitive Protein Similarity Searches Science 1985 227 1435-1441 2983426
27. Seward J bzip2 and libbzip2 - A program and library for data compression 1.0.3 1997
28. Hunt JW Szymanski TG A Fast Algorithm for Computing Longest Common Subsequences Communications of the ACM 1977 20 350-353
29. Ning ZM Cox AJ Mullikin JC SSAHA: A fast search method for large DNA databases Genome Res 2001 11 1725-1729 311141 11591649
30. Burkhardt S Karkkainen J One-gapped q-gram filters for Levenshtein distance Combinatorial Pattern Matching Berlin, SPRINGER-VERLAG BERLIN Lecture Notes in Computer Science 2002 2373 225-234
31. Kruskal JB Jr. On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem Proceedings of the American Mathematical Society 1956 7 48-50
32. Prim RC Shortest Connection Networks and Some Generalizations Bell System Technical Journal 1957 36 1389-1401
33. Moret B Shapiro H Algorithms from P to NP: Design and Efficiency Redwood City, CA, Benjamin/Cummings 1991
34. Tarjan RE Efficiency of a Good but Not Linear Set Union Algorithm J ACM 1975 22 215-225
35. Myers EW An O(ND) Difference Algorithm and its Variations Algorithmica 1986 1 251-266
36. GenBank Sequence Database http://www.ncbi.nlm.nih.gov/Genbank/index.html
37. Shkarin D PPM: One Step to Practicality 2002 202-211
38. 7-Zip http://www.7-zip.org