(Enter summary)
Abstract: this paper, we settle the diameter problem for the
syntenic distance over n-chromosome genomes. Note that because we allow for an
arbitrary number N of genes, the space of all possible n-chromosome genomes is
in fact innite; so it is not immediately apparent that the diameter of this space
should be nite. However, it is not dicult to show that the diameter can be
bounded by a function of n, as we will see in the next section. Indeed, in previous
work, the second author [20] established an... (Update)
Context of citations to this paper: More
...a worst instance of this size, and implies that D y (n) is exactly the number of moves required to solve this instance. In recent work [9], we have shown that this number is 2n 4. We have recently learned that Pisanti and Sagot [12] have given an independent proof of this fact....
.... there are ecient 2 approximations [10, 12, 23] Recent work has also explored some of the rich combinatorial structure of this model [10, 21, 23, 24, 25]. In this paper, we present an improved (exponentialtime) algorithm for exactly computing syntenic distance. Our algorithm...
Cited by: More
On Maximal Instances for the Original Syntenic Distance - Cedric Chauve Lacim (2003)
(Correct)
Gossip is Synteny: Incomplete Gossip and the Syntenic Distance .. - Liben-Nowell
(Correct)
Gossip is Synteny: Incomplete Gossip and an Exact Algorithm.. - Liben-Nowell
(Correct)
Similar documents (at the sentence level):
72.1%: The Syntenic Diameter Of The Space Of N-Chromosome Genomes - Kleinberg, Liben-Nowell (2000)
(Correct)
53.4%: The Syntenic Diameter of the Space of N-Chromosome Genomes - Kleinberg, Liben-Nowell (2000)
(Correct)
Active bibliography (related documents): More All
1.0: Structural Properties and Tractability Results for Linear.. - Liben-Nowell, Kleinberg (2000)
(Correct)
0.5: On the Structure of Syntenic Distance - Liben-Nowell (1999)
(Correct)
0.4: Algorithms For Constructing Comparative Maps - Goldberg, McCouch, Kleinberg (2000)
(Correct)
Similar documents based on text: More All
0.5: On the Complexity and Approximation of Syntenic Distance - DasGupta, Jiang, Kannan, .. (1998)
(Correct)
0.5: Alignment of Whole Genomes - Delcher, Kasif, Fleischmann.. (1999)
(Correct)
Related documents from co-citation: More All
4: Sorting by transpositions (context) - Bafna, Pevzner
4: Genome Rearrangements and Sorting by Reversals (context) - Bafna, Pevzner - 1993
4: Further thoughts on the syntenic distance between genomes
- Pisanti, Sagot - 2000
BibTeX entry: (Update)
Jon Kleinberg and David Liben-Nowell. The syntenic diameter of the space of N-chromosome genomes. In David Sanko and Joseph H. Nadeau, editors, Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and the Evolution of Gene Families. Kluwer Academic Press, 2000. http://citeseer.ist.psu.edu/article/kleinberg00syntenic.html More
@misc{ kleinberg00syntenic,
author = "J. Kleinberg and D. Liben-Nowell",
title = "The syntenic diameter of the space of N-chromosome genomes",
text = "Jon Kleinberg and David Liben-Nowell. The syntenic diameter of the space
of N-chromosome genomes. In David Sanko and Joseph H. Nadeau, editors,
Comparative Genomics: Empirical and Analytical Approaches to Gene Order
Dynamics, Map Alignment and the Evolution of Gene Families. Kluwer Academic
Press, 2000.",
year = "2000",
url = "citeseer.ist.psu.edu/article/kleinberg00syntenic.html" }
Citations (may not include all citations):
184
A survey of gossiping and broadcasting in communication netw.. (context) - Hedetniemi, Hedetniemi et al. - 1988
127
Introduction to Computational Biology (context) - Waterman - 1995
112
and Sequences: Computer Science and Computational Biology (context) - Guseld, Strings - 1997
80
Genome rearrangements and sorting by reversals (context) - Bafna, Pevzner - 1996
53
Sorting by transpositions (context) - Bafna, Pevzner - 1998
42
Gene order comparisons for phylogenetic inference: Evolution.. (context) - Sanko, Leduc et al. - 1992
30
polynomial algorithm for genomic distance problem (context) - Hannenhalli, Pevzner et al. - 1995
28
approximation algorithm for sorting by reversals (context) - Christie - 1998
25
Open combinatorial problems in computational molecular biolo.. (context) - Pevzner, Waterman - 1995
24
Gossips and telephones (context) - Baker, Shostak - 1972
24
The chromosome inversion problem (context) - Watterson, Ewens et al.
22
Exact and approximation algorithms for the inversion distanc.. (context) - Kececioglu, Sanko - 1995
18
Genome Rearrangement Problems (context) - Christie - 1999
17
A problem with telephones (context) - Bumby - 1981
16
Sorting by reversals is dicult (context) - Caprara - 1997
15
Lengths of chromosomal segments conserved since divergence o.. (context) - Nadeau, Taylor - 1984
14
Of mice and men: Algorithms for evolutionary distance betwee..
- Kececioglu, Ravi - 1995
11
Nieuw Archief voor Wiskunde (context) - Tijdeman, problem - 1971
11
Conserved synteny as a measure of genomic distance (context) - Sanko, Nadeau - 1996
9
Canadian Mathematical Bulletin (context) - Hajnal, Milner et al. - 1972
9
Synteny conservation and chromosome rearrangements during ma.. (context) - Ehrlich, Sanko et al. - 1997
9
Personal Communication (context) - Cormode, Paterson - 1999
8
Edit distance for genome comparison based on non-local opera.. (context) - Sanko - 1992
5
and David Sanko (context) - Ferretti, Nadeau - 1996
4
special issue on computational biology (context) - DasGupta, Jiang et al. - 1998
4
A Computational Theory of Genome Rearrangements (context) - Hannenhalli, into - 1995
3
the structure of syntenic distance
- Liben-Nowell - 1999
1
Bounds for sorting by prex reversals (context) - Gates, Papadimitriou - 1979
Documents on the same site (http://www.cs.cornell.edu/home/dln/research.html):
Structural Properties and Tractability Results for Linear.. - Liben-Nowell, Kleinberg (2000)
(Correct)
On the Structure of Syntenic Distance - Liben-Nowell (1999)
(Correct)
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