10
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Multiscale DNA partitioning: statistical evidence for segments

      , , ,
      Bioinformatics
      Oxford University Press (OUP)

      Read this article at

      ScienceOpenPublisherPubMed
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          DNA segmentation, i.e. the partitioning of DNA in compositionally homogeneous segments, is a basic task in bioinformatics. Different algorithms have been proposed for various partitioning criteria such as Guanine/Cytosine (GC) content, local ancestry in population genetics or copy number variation. A critical component of any such method is the choice of an appropriate number of segments. Some methods use model selection criteria and do not provide a suitable error control. Other methods that are based on simulating a statistic under a null model provide suitable error control only if the correct null model is chosen.

          Related collections

          Most cited references24

          • Record: found
          • Abstract: found
          • Article: not found
          Is Open Access

          Differential GC content between exons and introns establishes distinct strategies of splice-site recognition.

          During evolution segments of homeothermic genomes underwent a GC content increase. Our analyses reveal that two exon-intron architectures have evolved from an ancestral state of low GC content exons flanked by short introns with a lower GC content. One group underwent a GC content elevation that abolished the differential exon-intron GC content, with introns remaining short. The other group retained the overall low GC content as well as the differential exon-intron GC content, and is associated with longer introns. We show that differential exon-intron GC content regulates exon inclusion level in this group, in which disease-associated mutations often lead to exon skipping. This group's exons also display higher nucleosome occupancy compared to flanking introns and exons of the other group, thus "marking" them for spliceosomal recognition. Collectively, our results reveal that differential exon-intron GC content is a previously unidentified determinant of exon selection and argue that the two GC content architectures reflect the two mechanisms by which splicing signals are recognized: exon definition and intron definition. Copyright © 2012 The Authors. Published by Elsevier Inc. All rights reserved.
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            On the genetic basis of variation and heterogeneity of DNA base composition.

            N SUEOKA (1962)
              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Optimal detection of changepoints with a linear computational cost

              , , (2012)
              We consider the problem of detecting multiple changepoints in large data sets. Our focus is on applications where the number of changepoints will increase as we collect more data: for example in genetics as we analyse larger regions of the genome, or in finance as we observe time-series over longer periods. We consider the common approach of detecting changepoints through minimising a cost function over possible numbers and locations of changepoints. This includes several established procedures for detecting changing points, such as penalised likelihood and minimum description length. We introduce a new method for finding the minimum of such cost functions and hence the optimal number and location of changepoints that has a computational cost which, under mild conditions, is linear in the number of observations. This compares favourably with existing methods for the same problem whose computational cost can be quadratic or even cubic. In simulation studies we show that our new method can be orders of magnitude faster than these alternative exact methods. We also compare with the Binary Segmentation algorithm for identifying changepoints, showing that the exactness of our approach can lead to substantial improvements in the accuracy of the inferred segmentation of the data.
                Bookmark

                Author and article information

                Journal
                Bioinformatics
                Oxford University Press (OUP)
                1367-4803
                1460-2059
                August 15 2014
                April 21 2014
                August 15 2014
                April 21 2014
                : 30
                : 16
                : 2255-2262
                Article
                10.1093/bioinformatics/btu180
                24753487
                5374c637-0b3b-4f48-8af3-a7bcad38d3f2
                © 2014
                History

                Comments

                Comment on this article