The purpose of this project is to compare the complexities of different species' mitochondrial genome sequences. Using an implementation of Deflate compression algorithm from Java standard library, we were able to compress mitochondrial genomes of nine different species. The complexity of each sequence is estimated as a ratio of the original sequence length to the length of the compressed sequence. In addition, we show how a notion of topological entropy from symbolic dynamics can be used as another complexity measure of nucleotide sequences.
"Complexity of Mitochondrial Genome Sequences,"
Undergraduate Journal of Mathematical Modeling: One + Two:
2, Article 3.
DOI: http://dx.doi.org/10.5038/2326-3618.104.22.168 Available at: http://scholarcommons.usf.edu/ujmm/vol4/iss2/3
Arcadii Grinshpan, Mathematics and Statistics
Egor Dolzhenko, Princeton University: Evolutionary Biology VSRC