Multiple genome rearrangement by swaps and by element duplications

Theoretical Computer Science

Volumn 385, Issue 1-3, 2007, Pages 115-126

  Popov, V Yu ^a  

^a URAL FEDERAL UNIVERSITY   (Russian Federation)

Author keywords

Distance function; Multiple sorting; NP complete

Indexed keywords

GENES; PROBLEM SOLVING;

DISTANCE FUNCTION; MULTIPLE SORTING; SWAP CENTRE PERMUTATION PROBLEM;

DISTANCE MEASUREMENT;

EID: 34548663654     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.05.029     Document Type: Article

References (29)

1. Li W.H., and Graur D. Fundamentals of molecular evolution (1991), Sinauer, Sulderland, MA
2. Palmer J., and Herbon L. Tricircular mitochondrial genomes of Brassica and Raphanus: Reversal of repeat configurations by inversion. Nucleic Acids Research 14 (1986) 9755-9764
3. Palmer J., and Herbon L. Unicircular structure of the Brassica hirta mitochondrial genome. Current Genetics 11 (1987) 565-570
4. Palmer J., and Herbon L. Plant mitochondrial DNA evolves rapidly in structure, but slowly in sequence. Journal of Molecular Evolution 28 (1988) 87-89
5. Palmer J., Osorio B., and Thompson W. Evolutionary significance of inversions in legume chloroplast DNAs. Current Genetics 14 (1988) 65-74
6. Hoot S.B., and Palmer J.D. Structural rearrangements, including parallel inversions, within the chloroplast genome of Anemone and related genera. Journal of Molecular Evolution 38 (1994) 274-281
7. Caprara A. Sorting permutations by reversals and Eulerian cycle decompositions. SIAM Journal on Discrete Mathematics 12 (1999) 91-110
8. H. Kaplan, R. Shamir, R.E. Tarjan, Faster and simler algorithm for sorting sined permutations by reversals, in: Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, 1997, pp. 344-351
9. Watterson G.A., Ewens W.J., Hall T.E., and Morgan A. The chromosome inversion problem. Journal of Theoretical Biology 99 (1982) 1-7
10. A. Caprara, Formulations and complexity of multiple sorting by reversals, in: Proceedings of the 3th Annual International Conference on Computational Molecular Biology, 1999, pp. 84-93
11. I. Pe'er, R. Shamir, The median problems for breakpoints are NP-complete, Technical report TR98-071, The Electronic Colloquium of Computational Complexity, 1998
12. Solomon A., Sutcliffe P., and Lister R. Sorting circular permutations by reversal. Proceedings of the Workshop on Algorithms and Data Structures. Carleton Univ., Ottawa, Canada (2003), Springer 1-10
13. Christie D.A., and Irving R.W. Sorting strings by reversals and by transpositions. SIAM Journal on Discrete Mathematics 14 (2001) 193-206
14. A.J. Radcliffe, A.D. Scott, E.L. Wilmer, Reversals and transpositions over finite alphabets, Univ. of Cambridge, Isaac Newton Institute for Mathematical Sciences, IP02109-CMP
15. Hall Jr. M. The Theory of Groups (1959), The Macmillan Company, New York
16. Jerrum M.R. The complexity of finding minimum-length generator sequences. Theoretical Computer Science 36 (1985) 265-289
17. D.S. Hirschberg, The longest common subsequence problem, Ph.D. Thesis, Princeton University, 1975
18. Maier D. The complexity of some problems on subsequences and supersequences. Journal of the ACM 25 (1978) 322-336
19. Hirschberg D.S. Recent results on the complexity of common subsequence problems. In: Sankoff D., and Kruskal J.B. (Eds). Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison (1983), Addison-Wesley, Reading, MA 325-330
20. Irving R.W., and Fraser C.B. Two algorithms for the longest common subsequence of three (or more) strings. In: Apostolico A., Crochemore M., Galil Z., and Manber U. (Eds). Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science vol. 644 (1992), Springer-Verlag, Berlin 214-229
21. Bodlaender H.L., Downey R.G., Fellows M.R., and Wareham H.T. The parameterized complexity of sequence alignment and consensus. Theoretical Computer Science 147 (1995) 31-54
22. Frances M., and Litman A. On covering problems of codes. Theory of Computer Systems 30 (1997) 113-119
23. J.K. Lanctot, M. Li, B. Ma, S. Wang, L. Zhang, Distinguishing string selection problems, in: Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, 1999, pp. 633-642
24. Knuth D. The art of computer programming. Sorting and Searching vol. III (1973), Addison-Wesley, Reading, MA
25. Räihä K.J., and Ukkonen E. The shortest common supersequence problem over binary alphabet is NP-complete. Theoretical Computer Science 16 (1981) 187-198
26. Charlesworth B., Sniegowski P., and Stephan W. The evolutionary dynamics of repetitive DNA in eukaryotes. Nature 371 (1994) 215-220
27. Crochemore M., and Sagot M.-F. Motifs in sequences: Localization and extraction. Handbook of Computational Chemistry (2002), Marcel Dekker Inc.
28. M.T. Hallet, An integrated complexity analysis of problems from computational biology, Ph.D. Thesis, Department of Computer Science, University of Victoria, Victoria, BC, Canada, 1996
29. Timkovskii V.G. Complexity of common subsequence and supersequence problems and related problems. Kibernetika 5 (1989) 1-13 English Translation