An approximation algorithm for the minimum breakpoint linearization problem

IEEE/ACM Transactions on Computational Biology and Bioinformatics

Volumn 6, Issue 3, 2009, Pages 401-409

  Chen, Xin ^a   Cui, Yun ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Approximation algorithms; Breakpoint distance; Comparative genomics; Partially ordered genomes

Indexed keywords

BREAKPOINT; BREAKPOINT DISTANCE; COMPARATIVE GENOMICS; GENE MAPS; GENETIC MAPPING; GENOME REARRANGEMENTS; LINEARIZATION PROBLEM; NP-HARD; OPTIMIZATION PROBLEMS; PARTIAL ORDER; PARTIALLY ORDERED GENOMES; TOTAL ORDER;

COMPUTATIONAL COMPLEXITY; GENES; HEURISTIC ALGORITHMS; LINEARIZATION;

APPROXIMATION ALGORITHMS;

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; CHROMOSOME MAP; GENE REARRANGEMENT; GENOMICS; METHODOLOGY;

ALGORITHMS; CHROMOSOME MAPPING; GENE REARRANGEMENT; GENOMICS; MODELS, GENETIC;

EID: 68649096085     PISSN: 15455963     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCBB.2009.3     Document Type: Article

References (9)

1. G. Blin, E. Blais, D. Hermelin, P. Guillon, M. Blanchette, and N. El-Mabrouk, "Gene Maps Linearization Using Genomic Rearrangement Distances," J. Computational Biology, vol.14, no.4, pp. 394-407, 2007. (Pubitemid 46911214)
2. Z. Fu and T. Jiang, "Computing the Breakpoint Distance between Partially Ordered Genomes," J. Bioinformatics and Computational Biology, vol.5, no.5, pp. 1087-1101, 2007. (Pubitemid 47570605)
3. C. Zheng, A. Lenert, and D. Sankoff, "Reversal Distance for Partially Ordered Genomes," Bioinformatics, vol.21, suppl. 1, pp. i502-i508, 2005. (Pubitemid 41794525)
4. C. Zheng and D. Sankoff, "Genome Rearrangements with Partially Ordered Chromosomes," J. Combinatorial Optimization, vol.11, no.2, pp. 133-144, 2006. (Pubitemid 41450186)
5. D. Ware, P. Jaiswal, J. Ni, X. Pan, K. Chang, K. Clark, L. Teytelman, S. Schmidt, W. Zhao, S. Cartinhour, S. McCouch, and L. Stein, "Gramene: A Resource for Comparative Grass Geno- mics," Nucleic Acids Research, vol.30, no.1, pp. 103-105, 2002. (Pubitemid 34679516)
6. I.V. Yap, D. Schneider, J. Kleinberg, D. Matthews, S. Cartinhour, and S.R. McCouch, "A Graph-Theoretic Approach to Comparing and Integrating Genetic, Physical and Sequence-Based Maps," Genetics, vol.165, no.4, pp. 2235-2247, 2003. (Pubitemid 38040303)
7. V. Kann, "On the Approximability of NP-Complete Optimization Problems," PhD dissertation, Dept. of Numerical Analysis and Computing Science, Royal Inst. of Technology, 1992.
8. C. Demetrescu and I. Finocchi, "Combinatorial Algorithms for Feedback Problems in Directed Graphs," Combinatorica, vol.15, 281-288.
9. C. Demetrescu and G.F. Italiano, "Fully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier," Proc. IEEE Symp. Foundations of Computer Science, pp. 381-389, 2000. (Pubitemid 32075907)