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

      A New Combinatorial Approach to Sequence Comparison

      , , ,
      Theory of Computing Systems
      Springer Nature America, Inc

      Read this article at

      ScienceOpenPublisher
      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.

          Related collections

          Most cited references16

          • Record: found
          • Abstract: found
          • Article: not found

          An information-based sequence distance and its application to whole mitochondrial genome phylogeny.

          Traditional sequence distances require an alignment and therefore are not directly applicable to the problem of whole genome phylogeny where events such as rearrangements make full length alignments impossible. We present a sequence distance that works on unaligned sequences using the information theoretical concept of Kolmogorov complexity and a program to estimate this distance. We establish the mathematical foundations of our distance and illustrate its use by constructing a phylogeny of the Eutherian orders using complete unaligned mitochondrial genomes. This phylogeny is consistent with the commonly accepted one for the Eutherians. A second, larger mammalian dataset is also analyzed, yielding a phylogeny generally consistent with the commonly accepted one for the mammals. The program to estimate our sequence distance, is available at http://www.cs.cityu.edu.hk/~cssamk/gencomp/GenCompress1.htm. The distance matrices used to generate our phylogenies are available at http://www.math.uwaterloo.ca/~mli/distance.html.
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Information distance

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Counting permutations with given cycle structure and descent set

                Bookmark

                Author and article information

                Journal
                Theory of Computing Systems
                Theory Comput Syst
                Springer Nature America, Inc
                1432-4350
                1433-0490
                April 2008
                October 30 2007
                April 2008
                : 42
                : 3
                : 411-429
                Article
                10.1007/s00224-007-9078-6
                1f53e131-9fbf-47dc-9532-f47bbcedbf0f
                © 2008
                History

                Comments

                Comment on this article