Download:
|
by David Liben-nowell, Jon Kleinberg
11th Annual Symposium on Combinatorial Pattern Matching
http://www.cs.cornell.edu/home/dln/cpm00.ps
Add To MetaCart
Abstract:
Abstract. The syntenic distance between two species is the minimum number of fusions, ssions, and translocations required to transform one genome into the other. The linear syntenic distance, a restricted form of this model, has been shown to be close to the syntenic distance. Both models are computationally dicult to compute and have resisted ef-cient approximation algorithms with non-trivial performance guarantees. In this paper, we prove that many useful properties of syntenic distance carry over to linear syntenic distance. We also give a reduction from the general linear synteny problem to the question of whether a given instance can be solved using the maximum possible number of translocations. Our main contribution is an algorithm exactly computing linear syntenic distance in nested instances of the problem. This is the rst polynomial time algorithm exactly solving linear synteny for a non-trivial class of instances. It is based on a novel connection between the syntenic distance and a scheduling problem that has been studied in the operations research literature. 1
Citations
|
7709
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
192
|
Transforming cabbage into turnip (polynomial algorithm for sorting signed permutation by reversals
– Hannenhalli, Pevzner
- 1995
|
|
118
|
Genome rearrangement and sorting by reversals
– Bafna, Pevzner
- 1996
|
|
85
|
Sorting by transpositions
– Bafna, Pevzner
- 1998
|
|
73
|
On Some Tighter Inapproximability Results
– Berman, Karpinski
- 1998
|
|
62
|
Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
– Kececioglu, Sankoff
- 1995
|
|
45
|
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
– Caprara
- 1999
|
|
41
|
Fast sorting by reversals
– Berman, Hannenhalli
- 1996
|
|
35
|
A 3/2-approximation algorithm for sorting by reversals
– Christie
- 1998
|
|
27
|
Original synteny
– Ferretti, Nadeau, et al.
- 1996
|
|
27
|
Approximation algorithm for sorting by reversals
– Berman, Hannenhalli, et al.
- 2001
|
|
26
|
H.: A 2-approximation algorithm for genome rearrangements by reversals and transpositions
– Gu, Peng, et al.
- 1999
|
|
17
|
On the complexity and approximation of the syntenic distance
– DasGupta, Jing, et al.
- 1998
|
|
15
|
Conserved synteny as a measure of genomic distance
– Sankoff, Nadeau
- 1996
|
|
12
|
Sorting a bridge hand
– Eriksson, Eriksson, et al.
- 2001
|
|
11
|
On the structure of syntenic distance
– Liben-Nowell
- 1999
|
|
10
|
Scheduling to Minimize Maximum Cumulative Cost Subject to Series-parallel Precedence Constraints
– Abdel-Wahab, Kameda
- 1978
|
|
10
|
Sorting by reversals is dicult
– Caprara
- 1997
|
|
10
|
Synteny conservation and chromosome rearrangements during mammalian evolution
– Ehrlich, Sanko, et al.
- 1997
|
|
3
|
A general algorithm for optimal job sequencing with seriesparallel precedence constraints
– Monma, Sidney
- 1977
|
|
2
|
1+#)-approximation of sorting by reversals and transpositions
– Erikson
- 2001
|
