J.H. Nadeau and D. Sanko#. Counting on comparative maps. Trends Genet. 14(1998), 495-501. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Similarity Distance and Phylogeny - Li, Li, Ma, Vitányi (2002) (Correct)
....divided by total number of genes. While this approach does not work here due to the fact that all 20 mammalian mitochondrial genomes share exactly the same genes, notice the similarity of gene content formula and our general formula. Rearrangement Distance: Reversal and rearrangement distances in [18, 17, 27] compare genomes using other partial genome information such as number of reversals or translocations. These operations also do not appear in our mammalian mitochondrial genomes, hence the method again is not proper for our application. Transformation Distance or Compression Distance: The ....
J.H. Nadeau and D. Sanko . Counting on comparative maps. Trends Genet. 14(1998), 495-501.
An Information Based Sequence Distance and Its.. - Li, Badger, Chen, .. (2001) (9 citations) (Correct)
....and gene content(FitzGibbon and House, 1999; Snel et al. 1999) Such comparisons are time consuming as they require gene identi cation. These distances, together with G C content; edit distance; and reversal and rearrangement distances (Kececioglu and Sanko , 1995; Hannenhalli and Pevzner, 1995; Nadeau and Sanko , 1998) compare genomes using only partial genome information whereas our new distance uses all genome information. The transformation distance (Varre et al. 1998) and compression distance(Grumbach and Tahi, 1994) are essentially de ned as K(xjy) which is badly asymmetric, and so, is not a distance. ....
Nadeau, J. H. and Sanko , D. (1998). Counting on comparative maps. Trends Genet., 14:495-501.
Algorithms For Constructing Comparative Maps - Goldberg, McCouch, Kleinberg (2000) (2 citations) (Correct)
.... can view this as a generalization of the standard edit distance used for sequence alignment [16, 49] viewed at the scale of whole genomes and allowing highly non local transformations [37, 38] For surveys on this approach, see Pevzner and Waterman [35] Hannenhalli [17] and Nadeau and Sanko# [31]. An algorithmic approach in a di#erent spirit can be found in Sanko#, Ferretti, and Nadeau [39] the authors describe rules for identifying corresponding regions in two genomes, without explicitly trying to minimize the length of a sequence of genome rearrangements. This is much more closely ....
J Nadeau and D Sanko#. Counting on comparative maps. Trends in Genetics, 14(12):495501, 1998.
Phylogenetic Invariants for Genome Rearrangements - Sankoff, Blanchette (1999) Self-citation (Sankoff) (Correct)
....terms of the order of genes along a chromosome, the key aspect for mathematical purposes is the order and not the fact that the entities in the order are genes. They could as well be blocks of genes contiguous in a number of species, conserved chromosomal segments in comparative genetic maps (cf. Nadeau and Sankoff, 1998), or, indeed, the results of any decomposition of the chromosome into disjoint ordered fragments, each identi# able in two or more genomes. 2. PHYLOGENY BASED ON GENE ORDER The extension of edit distances for gene order data to # nding globally optimal phylogenetic trees is inherently dif# cult. ....
Nadeau, J.H., and Sankoff, D. 1998. Counting on comparative maps. Trends Genet. 14, 495--501.
The Similarity Metric - Xin (2003) (8 citations) (Correct)
No context found.
J.H. Nadeau and D. Sanko#. Counting on comparative maps. Trends Genet. 14(1998), 495-501.
The Similarity Metric - Li, Chen, Li, Ma, Vitanyi (2003) (8 citations) (Correct)
No context found.
J.H. Nadeau and D. Sanko#. Counting on comparative maps. Trends Genet. 14(1998), 495-501.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC