An optimal DNA segmentation based on the MDL principle.
|Title||An optimal DNA segmentation based on the MDL principle.|
|Publication Type||Journal Article|
|Year of Publication||2005|
|Authors||Szpankowski W, Ren W, Szpankowski L|
|Journal||Int J Bioinform Res Appl|
|Keywords||Algorithms, Base Sequence, Binding Sites, Chromosome Mapping, Chromosomes, Human, Pair 20, Chromosomes, Human, Pair 9, Computational Biology, CpG Islands, DNA, Female, Humans, Male, Models, Genetic, Models, Statistical, Molecular Sequence Data, Mutation, Ribosomes, Sequence Analysis, DNA, Sex Factors, Stochastic Processes|
The biological world is highly stochastic and inhomogeneous in its behaviour. There are regions in DNA with a high concentration of G or C bases; stretches of sequences with an abundance of CG dinucleotide (CpG islands); coding regions with strong periodicity-of-three pattern, and so forth. Transitions between these regions of DNA, known also as change points, carry important biological information. Computational methods used to identify these homogeneous regions are called segmentations. Viewing a DNA sequence as a non-stationary process, we apply recent novel techniques of universal source coding to discover stationary (possibly recurrent) segments. In particular, the Stein-Ziv lemma is adopted to find an asymptotically optimal discriminant function that determines whether two DNA segments are generated by the same source assuring exponentially small false positives. Next, we use the Minimum Description Length (MDL) principle to select parameters that lead to a linear-time segmentation algorithm. We apply our algorithm to human chromosome 9 and chromosome 20 to discover coding and noncoding regions, starting positions of genes, as well as the beginning of CpG islands.
|Alternate Title||Int J Bioinform Res Appl|