Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Elizabeth Sweedyk  Home/Search
Context Related
| wh.math.uwaterloo.ca/pape...Syntenic.ps rutgers.edu/~bhaskar/...syn4.final.ps.Z ucsb.edu/~mli/Bioinf/pu...97Syntenic.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.uwaterloo.ca/~mli/ (more) From: rutgers.edu/~bhaskar/resum...publ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nadeau and Sankoff. Here, a chromosome is represented as a set of genes and a genome is a collections of chromosomes. The syntenic distance between two genomes is defined as the minimum number of translocations, fusions and fissions required to transform one genome into the other. We prove that computing the syntenic... (Update)
Cited by: More
Further Thoughts on the Syntenic Distance between Genomes - Pisanti, Sagot (2000) (Correct)
On Maximal Instances for the Original Syntenic Distance - Cedric Chauve Lacim (2003) (Correct)
The Complexity of Gene Placement - Leslie Ann Goldberg (Correct)
Similar documents (at the sentence level):
53.0%: On the Complexity and Approximation of Syntenic Distance - Dasgupta Jiang (1997) (Correct)
5.5%: Selected Topics in Computational Biology - DasGupta, Wang (1998) (Correct)
Active bibliography (related documents): More All
0.2: 1.375-Approximation Algorithm for Sorting by Reversals - Berman, Hannenhalli.. (2001) (Correct)
0.1: Fast Sorting by Reversal - Berman, Hannenhalli (1996) (Correct)
0.1: Towards a Computational Theory of Genome Rearrangements - Hannenhalli, Pevzner (1995) (Correct)
Similar documents based on text: More All
1.7: On the Structure of Syntenic Distance - Liben-Nowell (1999) (Correct)
1.2: Gossip is Synteny: Incomplete Gossip and an Exact Algorithm.. - Liben-Nowell (Correct)
0.9: Structural Properties and Tractability Results for Linear.. - Liben-Nowell, Kleinberg (2000) (Correct)
Related documents from co-citation: More All
10: Sorting by transpositions (context) - Bafna, Pevzner
8: Genome Rearrangements and Sorting by Reversals (context) - Bafna, Pevzner - 1993
8: polynomial algorithm for sorting signed permutations by reversals (context) - Hannenhalli, Pevzner et al. - 1995
BibTeX entry: (Update)
B. DasGupta, T. Jiang, S. Kannan, M. Li and E. Sweedyk. On the Complexity and Approximation of Syntenic Distance, 1st Annual International Conference On Computational Molecular Biology, 1997, pp. 99-108 (journal version to appear in Discrete and Applied Mathematics) . http://citeseer.ist.psu.edu/article/dasgupta98complexity.html More
@inproceedings{ dasgupta97complexity,
author = "B. DasGupta and Tao Jiang and Sampath Kannan and Ming Li and Z. Sweedyk",
title = "On the complexity and approximation of syntenic distance",
booktitle = "{RECOMB}",
pages = "99-108",
year = "1997",
url = "citeseer.ist.psu.edu/article/dasgupta98complexity.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
80 Genome Rearrangements and Sorting by Reversals (context) - Bafna, Pevzner - 1993
53 Sorting by Transpositions (context) - Bafna, Pevzner - 1995
48 polynomial algorithm for sorting signed permutations by reve.. (context) - Hannenhalli, Pevzner et al. - 1995
37 Exact and Approximation Algorithms for Sorting by Reversals - Kececioglu, Sankoff - 1995
35 Prentice-Hall Inc (context) - Papadimitriou, Steiglitz et al. - 1982
31 Efficient Bounds for Oriented Chromosome Inversion Distance (context) - Kececioglu, Sankoff - 1994
23 Sorting by Reversals: Genome Rearrangements in Plant Organel.. (context) - Bafna, Pevzner - 1995
22 Exact and Approximation Algorithms for the Inversion Distanc.. (context) - Kececioglu, Sankoff - 1993
14 Of Mice and Men: Evolutionary Distances Between Genomes unde.. (context) - Kececioglu, Ravi - 1995
13 Original Synteny (context) - Ferretti, Nadeau et al. - 1996
2 A Separator Theorem for Directed Acyclic Graphs (context) - Kannan, Sweedyk
1 personal email communication (context) - Ambainis
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.uwaterloo.ca/~mli/): More
Recovering Branches on the Tree of Life: An Approximation .. - Kearney, Li, Tsang, Jiang (1999) (Correct)
Optimality of Wait-Free Atomic Multiwriter Variables - Li, Vitanyi (1991) (Correct)
Kolmogorov Complexity Arguments in Combinatorics - Li, Vitányi (1994) (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