The zero exemplar distance problem

Journal of Computational Biology

Volumn 18, Issue 9, 2011, Pages 1077-1086

  Jiang, Minghui ^a  

^a Utah State University ^*  (United States)

Author keywords

computational complexity; exemplar model; genome rearrangement

Indexed keywords

ALGORITHM; BIOLOGICAL MODEL; CHROMOSOME; COMPUTER SIMULATION; CONFERENCE PAPER; DNA SEQUENCE; GENE DOSAGE; GENE ORDER; GENETICS; GENOME; METHODOLOGY; MUTATION;

ALGORITHMS; CHROMOSOMES; COMPUTER SIMULATION; GENE DOSAGE; GENE ORDER; GENOME; MODELS, GENETIC; MUTATION; SEQUENCE ANALYSIS, DNA;

EID: 80052615064     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2011.0097     Document Type: Conference Paper

References (15)

1. Adi, S.S., Braga, M.D.V., Fernandes, C.G., et al. 2010. Repetition-free longest common subsequence. Discrete Appl. Math. 158, 1315-1324.
2. Angibaud, S., Fertin, G., Rusu, I., et al. 2009. On the approximability of comparing genomes with duplicates. J. Graph Algorithms Appl. 13, 19-53.
3. Blin, G., Fertin, G., Sikora, F., et al. 2009. The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated. Proc. WALCOM'09 357-368.
4. Bonizzoni, P., Della Vedova, G., Dondi, R., et al. 2007. Exemplar longest common subsequence. IEEE-ACM Trans. Comput. Biol. Bioinform. 4, 535-543. (Pubitemid 350125877)
5. Chauve, C., and Fertin, G 2004. On maximal instances for the original syntenic distance. Theor. Comput. Sci. 326, 29-43.
6. Chen, Z., Fowler, R.H., Fu, B., et al. 2008. On the inapproximability of the exemplar conserved interval distance problem of genomes. J. Comb. Optim. 15, 201-221.
7. Chen, Z., Fu, B., and Zhu, B. 2006. The approximability of the exemplarbreakpoint distance problem. Proc. AAIM'06 291-302.
8. Das Gupta, B., Jiang, T., Kannan, S., et al. 1998. On the complexity and approximation of syntenic distance. Discrete Appl. Math. 88, 59-82. (Pubitemid 128379047)
9. Downey, R.G., and Fellows, M.R. 1999. Parameterized Complexity. Springer-Verlag, New York.
10. Ferretti, V., Nadeau, J.H., and Sankoff, D. 1996. Original synteny. Proc. CPM'96, 159-167. (Pubitemid 126073717)
11. Garey, M.R., and Johnson, D.S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York.
12. Gusfield, D. 1997. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge, UK.
13. Liben-Nowell, D. 2002. Gossip is synteny: incomplete gossip and the syntenic distance between genomes. J. Algorithms 43, 264-283.
14. Sankoff, D. 1999. Genome rearrangement with gene families. Bioinformatics 15, 909-917 (Pubitemid 30103161)
15. Tarjan, R.E. 1983. Data Structures and Network Algorithms. SIAM, Washington, DC