2012 23rd International Workshop on Database and Expert Systems Applications (DEXA) (2012)
Sept. 3, 2012 to Sept. 7, 2012
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DEXA.2012.10
With the progress of modern sequencing technologies a number of complete genomes is now available. Traditional motif discovery tools cannot handle this massive amount of data, therefore the comparison of complete genomes can be carried out only with ad hoc methods. In this work we propose a distance function based on subword compositions, which extends the Average Common Subword approach(ACS) of Ulitsky et al. ACS is closely related to the cross entropy estimated between two entire genome sequences, and thus to some set of ``independent'' subwords, namely their redundant common subwords. Then, we filter their redundant common subwords by means of underlying-paired motifs, which relate to each other regions of two genome sequences. This set of motifs is, by construction, linear in the size of input and without overlap; we call the selected motifs, underlying-paired irredundant common subwords, or simply unic subwords. Preliminary results show the validity of our method, and suggest novel computational approaches for analyzing the evolution of genomes.
bioinformatics, genetics, genomics, information filtering, sequences, text analysis
M. Comin and D. Verzotto, "Whole-Genome Phylogeny by Virtue of Unic Subwords," 2012 23rd International Workshop on Database and Expert Systems Applications(DEXA), Vienna, Austria Austria, 2012, pp. 190-194.