On the representability of complete genomes by multiple competing finite-context (Markov) models

PLoS ONE

Volumn 6, Issue 6, 2011, Pages

  Pinho, Armando J ^a   Ferreira, Paulo J S G ^a   Neves, António J R ^a   Bastos, Carlos A C ^a  

^a UNIVERSITY OF AVEIRO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; DATA ANALYSIS; DNA DETERMINATION; DNA SEQUENCE; GENOME; GENOME ANALYSIS; MARKOV MODEL; MOLECULAR MODEL; NUCLEOTIDE SEQUENCE; PROBABILITY; STATISTICAL ANALYSIS; STATISTICAL MODEL; ANIMAL; BIOLOGY; GENETICS; HUMAN; METHODOLOGY;

EUKARYOTA; PROKARYOTA;

ANIMALS; COMPUTATIONAL BIOLOGY; GENOME; HUMANS; MARKOV CHAINS;

EID: 79959722141     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0021588     Document Type: Article

References (47)

1. Grumbach S, Tahi F, (1993) Compression of DNA sequences. pp. 340-350 In: Proc. of the Data Compression Conf., DCC-93. Snowbird, Utah.
2. Rivals E, Delahaye JP, Dauchet M, Delgrange O, (1996) A guaranteed compression scheme for repetitive DNA sequences. In: Proc. of the Data Compression Conf., DCC-96. Snowbird, Utah.
3. Loewenstern D, Yianilos PN, (1997) Significantly lower entropy estimates for natural DNA sequences. pp. 151-160 In: Proc. of the Data Compression Conf., DCC-97. Snowbird, Utah.
4. Chen X, Kwong S, Li M, (2001) A compression algorithm for DNA sequences. IEEE Engineering in Medicine and Biology Magazine 20: 61-66.
5. Tabus I, Korodi G, Rissanen J, (2003) DNA sequence compression using the normalized maximum likelihood model for discrete regression. pp. 253-262 In: Proc. of the Data Compression Conf., DCC-2003. Snowbird, Utah.
6. Manzini G, Rastero M, (2004) A simple and fast DNA compressor. Software-Practice and Experience 34: 1397-1411.
7. Korodi G, Tabus I, (2005) An efficient normalized maximum likelihood algorithm for DNA sequence compression. ACM Trans on Information Systems 23: 3-34.
8. Behzadi B, Le Fessant F, (2005) DNA compression challenge revisited. Combinatorial Pattern Matching: Proc. of CPM-2005 Jeju Island, Korea Springer-Verlag pp. 190-200 volume 3537 of LNCS.
9. Korodi G, Tabus I, (2007) Normalized maximum likelihood model of order-1 for the compression of DNA sequences. pp. 33-42 In: Proc. of the Data Compression Conf., DCC-2007. Snowbird, Utah.
10. Cao MD, Dix TI, Allison L, Mears C, (2007) A simple statistical algorithm for biological sequence compression. pp. 43-52 In: Proc. of the Data Compression Conf., DCC-2007. Snowbird, Utah.
11. Giancarlo R, Scaturro D, Utro F, (2009) Textual data compression in computational biology: a synopsis. Bioinformatics 25: 1575-1586.
12. Ziv J, Lempel A, (1977) A universal algorithm for sequential data compression. IEEE Trans on Information Theory 23: 337-343.
13. Borodovsky MY, Sprizhitsky YA, Golovanov EI, Aleksandrov AA, (1986) Statistical patterns in primary structures of the functional regions of the genome in Escherichia coli: I. Frequency characteristics. Molecular Biology 20: 823-833.
14. Borodovsky MY, Sprizhitsky YA, Golovanov EI, Aleksandrov AA, (1986) Statistical patterns in primary structures of the functional regions of the genome in Escherichia coli: II. Nonuniform Markov models. Molecular Biology 20: 833-840.
15. Tavaré S, Song B, (1989) Codon preference and primary sequence structure in protein-coding regions. Bulletin of Mathematical Biology 51: 95-115.
16. Borodovsky MY, McIninch J, (1993) GENMARK: Parallel gene recognition for both DNA strands. Computers & Chemistry 17: 123-133.
17. Burge CB, Karlin S, (1998) Finding the genes in genomic DNA. Current Opinion in Structural Biology 8: 346-354.
18. Salzberg SL, Pertea M, Delcher AL, Gardner MJ, Tettelin H, (1999) Interpolated Markov models for eukaryotic gene finding. Genomics 59: 24-31.
19. Stanke M, Waack S, (2003) Gene prediction with a hidden Markov model and a new intron submodel. Bioinformatics 19: ii215-ii225.
20. Delcher AL, Bratke KA, Powers EC, Salzberg SL, (2007) Identifying bacterial genes and endosymbiont DNA with Glimmer. Bioinformatics 23: 673-679.
21. Zhu W, Lomsadze A, Borodovsky M, (2010) Ab initio gene identification in metagenomic sequences. Nucleic Acids Research 38: e132.
22. Rho M, Tang H, Ye Y, (2010) FragGeneScan: predicting genes in short and error-prone reads. Nucleic Acids Research.
23. Robelin D, Richard H, Prum B, (2003) SIC: a tool to detect short inverted segments in a biological sequence. Nucleic Acids Research 31: 3669-3671.
24. Richard H, Nuel G, (2003) SPA: simple web tool to assess statistical significance of DNA patterns. Nucleic Acids Research 31: 3679-3681.
25. Liu Z, Chen D, Chen X, (2007) CpG island identification with higher order and variable order Markov models. pp. 47-58 In: Data Mining in Biomedicine, Springer, volume 7 of Springer Optimization and Its Applications.
26. Rissanen J, (1978) Modeling by shortest data description. Automatica 14: 465-471.
27. Allison L, Edgoose T, Dix TI, (1998) Compression of strings with approximate repeats. pp. 8-16 In: Proc. of Intelligent Systems in Molecular Biology, ISMB-98. Montreal, Canada.
28. Dix TI, Powell DR, Allison L, Bernal J, Jaeger S, et al. (2007) Comparative analysis of long DNA sequences by per element information content using different contexts. BMC Bioinformatics 8: S10.
29. Ferragina P, Giancarlo R, Greco V, Manzini G, Valiente G, (2007) Compression-based classification of biological sequences and structures via the universal similarity metric: experimental assessment. BMC Bioinformatics 8: 252.
30. Cao MD, Dix TI, Allison L, (2010) A genome alignment algorithm based on compression. BMC Bioinformatics 11: 599.
31. Allison L, Yee CN, (1990) Minimum message length encoding and the comparison of macromolecules. Bulletin of Mathematical Biology 52: 431-431.
32. Salamon P, Konopka AK, (1992) A maximum entropy principle for the distribution of local complexity in naturally occurring nucleotide sequences. Computers & Chemistry 16: 117-124.
33. Milosavljević A, Jurka J, (1993) Discovering simple DNA sequences by the algorithmic significance method. Computer Applications in the Biosciences 9: 407-411.
34. Bell TC, Cleary JG, Witten IH, (1990) Text compression. Prentice Hall.
35. Salomon D, (2007) Data compression- The complete reference. Springer, 4th edition.
36. Sayood K, (2006) Introduction to data compression. Morgan Kaufmann, 3rd edition.
37. Pinho AJ, Neves AJR, Ferreira PJSG, (2008) Inverted-repeats-aware finite-context models for DNA coding. In: Proc. of the 16th European Signal Processing Conf., EUSIPCO-2008. Lausanne, Switzerland.
38. Bayes T, (1763) An essay towards solving a problem in the doctrine of chances. Philosophical Transactions of the Royal Society of London 53: 370-418.
39. Laplace PS, (1774) Mémoire sur la probabilité des causes par les événements. 6: 621-656 Mémoires de l'Académie royale des Sciences de Paris (Savants étrangers) [Reprinted in Oeuvres complètes de Laplace, vol 8, Gauthier-Villars et fils, Paris, 1891, pp 27-65].
40. Venn J, (1888) The logic of chance London Macmillan and Co., 3rd (1st 1866, 2nd 1876) edition.
41. Hardy GF, (1889) Letter. Insurance Record [Reprinted in Trans of the Faculty of Actuaries, 8 (1920) pp 180-181].
42. Whittaker ET, (1920) On some disputed questions of probability. Trans of the Faculty of Actuaries 8: 163-206.
43. Johnson WE, (1932) Probability: the deductive and inductive problems. Mind XLI: 409-423.
44. Zabell SL, (1982) W. E. Johnson's "sufficientness" postulate. The Annals of Statistics 10: 1091-1099.
45. Zabell SL, (1989) The rule of succession. Erkenntnis 31: 283-321.
46. Brown M, Hughey R, Krogh A, Mian IS, Sjölander K, et al. (1993) Using Dirichlet mixture priors to derive hidden Markov models for protein families. pp. 47-55 In: Proc. of the 1st Int. Conf. on Intelligent Systems for Molecular Biology.
47. Sjölander K, Karplus K, Brown M, Hughey R, Krogh A, et al. (1996) Dirichlet mixtures: a method for improved detection of weak but significant protein sequence homology. Bioinformatics 12: 327-345.