메뉴 건너뛰기




Volumn 13, Issue 1, 2009, Pages 19-53

On the approximability of comparing genomes with duplicates

Author keywords

Adjacencies; Approximation algorithms; APX hardness; Breakpoints; Common intervals; Conserved intervals; Duplicate genes; Genome rearrangements

Indexed keywords


EID: 70349742235     PISSN: None     EISSN: 15261719     Source Type: Journal    
DOI: 10.7155/jgaa.00175     Document Type: Article
Times cited : (58)

References (25)
  • 1
    • 0001657065 scopus 로고    scopus 로고
    • Some APX-completeness results for cubic graphs
    • P. Alimonti and V. Kann. Some APX-completeness results for cubic graphs. Theoretical Computer Science, 237(1-2):123-134, 2000.
    • (2000) Theoretical Computer Science , vol.237 , Issue.1-2 , pp. 123-134
    • Alimonti, P.1    Kann, V.2
  • 2
    • 52449126703 scopus 로고    scopus 로고
    • Efficient tools for computing the number of breakpoints and the number of adjacencies between two genomes with duplicate genes
    • Submitted
    • S. Angibaud, G. Fertin, I. Rusu, A. Thévenin, and S. Vialette. Efficient tools for computing the number of breakpoints and the number of adjacencies between two genomes with duplicate genes. Journal of Computational Biology, 2008. Submitted.
    • (2008) Journal of Computational Biology
    • Angibaud, S.1    Fertin, G.2    Rusu, I.3    Thévenin, A.4    Vialette, S.5
  • 3
    • 34250375663 scopus 로고    scopus 로고
    • A general framework for computing rearrangement distances between genomes with duplicates
    • S. Angibaud, G. Fertin, I. Rusu, and S. Vialette. A general framework for computing rearrangement distances between genomes with duplicates. Journal of Computational Biology, 14(4):379-393, 2007.
    • (2007) Journal of Computational Biology , vol.14 , Issue.4 , pp. 379-393
    • Angibaud, S.1    Fertin, G.2    Rusu, I.3    Vialette, S.4
  • 4
    • 0028899657 scopus 로고
    • Sorting by reversals: Genome rearrangements in plant organelles and evolutionary history of X chromosome
    • V. Bafna and P. Pevzner. Sorting by reversals: genome rearrangements in plant organelles and evolutionary history of X chromosome. Molecular Biology and Evolution, pages 239-246, 1995.
    • (1995) Molecular Biology and Evolution , pp. 239-246
    • Bafna, V.1    Pevzner, P.2
  • 5
    • 0028317746 scopus 로고
    • Approximating maximum independent set in bounded degree graphs
    • Philadelphia, PA, USA, Society for Industrial and Applied Mathematics
    • P. Berman and M. Fürer. Approximating maximum independent set in bounded degree graphs. In Proc. SODA'94: Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, pages 365-371, Philadelphia, PA, USA, 1994. Society for Industrial and Applied Mathematics.
    • (1994) Proc. SODA'94: Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms , pp. 365-371
    • Berman, P.1    Fürer, M.2
  • 6
    • 26844563692 scopus 로고    scopus 로고
    • Conserved interval distance computation between non-trivial genomes
    • G. Blin and R. Rizzi. Conserved interval distance computation between non-trivial genomes. In Proc. COCOON 2005, volume 3595 of LNCS, pages 22-31. Springer, 2005.
    • (2005) Proc. COCOON 2005 , vol.3595 , pp. 22-31
    • Blin, G.1    Rizzi, R.2
  • 7
    • 4544335270 scopus 로고    scopus 로고
    • The complexity of calculating exemplar distances
    • Map Alignement, and the Evolution of Gene Families, Kluwer Academic Publisher
    • D. Bryant. The complexity of calculating exemplar distances. In Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignement, and the Evolution of Gene Families, pages 207-212. Kluwer Academic Publisher, 2000.
    • (2000) Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics , pp. 207-212
    • Bryant, D.1
  • 8
    • 0026929475 scopus 로고
    • Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
    • M.-S. Chang and F.-H. Wang. Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs. Information Processing Letters, 43(6):293-295, 1992.
    • (1992) Information Processing Letters , vol.43 , Issue.6 , pp. 293-295
    • Chang, M.-S.1    Wang, F.-H.2
  • 10
    • 33746598990 scopus 로고    scopus 로고
    • Genomes containing duplicates are hard to compare
    • C. Chauve, G. Fertin, R. Rizzi, and S. Vialette. Genomes containing duplicates are hard to compare. In Proc. IWBRA 2006, volume 3992 of LNCS, pages 783-790. Springer, 2006.
    • (2006) Proc. IWBRA 2006 , vol.3992 , pp. 783-790
    • Chauve, C.1    Fertin, G.2    Rizzi, R.3    Vialette, S.4
  • 11
    • 33749551283 scopus 로고    scopus 로고
    • Lower bounds on the approximation of the exemplar conserved interval distance problem of genomes
    • volume 4112 of LNCS, Springer
    • Z. Chen, R. Fowler, B. Fu, and B. Zhu. Lower bounds on the approximation of the exemplar conserved interval distance problem of genomes. In Proc COCOON 2006, volume 4112 of LNCS, pages 245-254. Springer, 2006.
    • (2006) Proc COCOON 2006 , vol.19 , pp. 245-254
    • Chen, Z.1    Fowler, R.2    Fu, B.3    Zhu, B.4
  • 12
    • 37749034336 scopus 로고    scopus 로고
    • Non-breaking similarity of genomes with gene repetitions
    • volume 4580 of LNCS
    • Z. Chen, B. Fu, J. Xu, B. Yang, Z. Zhao, and B. Zhu. Non-breaking similarity of genomes with gene repetitions. In Proc. CPM 2007, volume 4580 of LNCS, pages 119-130, 2007.
    • (2007) In Proc. CPM 2007 , pp. 119-130
    • Chen, Z.1    Fu, B.2    Xu, J.3    Yang, B.4    Zhao, Z.5    Zhu, B.6
  • 13
    • 33746238850 scopus 로고    scopus 로고
    • The approximability of the exemplar breakpoint distance problem
    • Z. Chen, B. Fu, and B. Zhu. The approximability of the exemplar breakpoint distance problem. In Proc. AAIM 2006, volume 4041 of LNCS, pages 291-302. Springer, 2006.
    • (2006) In Proc. AAIM 2006 , vol.4041 , pp. 291-302
    • Chen, Z.1    Fu, B.2    Zhu, B.3
  • 14
  • 15
    • 85036773709 scopus 로고    scopus 로고
    • Parameterized algorithms: A graph-theoretic approach. Habilitationsschrift
    • H. Fernau. Parameterized algorithms: A graph-theoretic approach. Habilitationsschrift, 2005.
    • (2005)
    • Fernau, H.1
  • 17
    • 26844512900 scopus 로고    scopus 로고
    • Minimum common string partition problem: Hardness and approximations
    • A. Goldstein, P. Kolman, and Z. Zheng. Minimum common string partition problem: Hardness and approximations. In Proc. ISAAC 2004, volume 3341 of LNCS, pages 473-484. Springer, 2004.
    • (2004) In Proc. ISAAC 2004 , vol.3341 , pp. 473-484
    • Goldstein, A.1    Kolman, P.2    Zheng, Z.3
  • 19
    • 38149094111 scopus 로고    scopus 로고
    • Reversal distance for strings with duplicates: Linear time approximation using hitting set
    • P. Kolman and T. Walen. Reversal distance for strings with duplicates: Linear time approximation using hitting set. In Proc. WAOA 2006, volume 4368 of LNCS, pages 279-289. Springer, 2006.
    • (2006) In Proc. WAOA 2006 , vol.4368 , pp. 279-289
    • Kolman, P.1    Walen, T.2
  • 20
    • 0035865239 scopus 로고    scopus 로고
    • Evolutionary analysis of the human genome
    • W. Li, Z. Gu, H. Wang, and A. Nekrutenko. Evolutionary analysis of the human genome. Nature, 409:847-849, 2001.
    • (2001) Nature , vol.409 , pp. 847-849
    • Li, W.1    Gu, Z.2    Wang, H.3    Nekrutenko, A.4
  • 23
    • 0033391532 scopus 로고    scopus 로고
    • Genome rearrangement with gene families
    • D. Sankoff. Genome rearrangement with gene families. Bioinformatics, 15(11):909-917, 1999.
    • (1999) Bioinformatics , vol.15 , Issue.11 , pp. 909-917
    • Sankoff, D.1
  • 24
    • 33646140925 scopus 로고    scopus 로고
    • Power boosts for cluster tests
    • D. Sankoff and L. Haque. Power boosts for cluster tests. In Proc. RECOMB-CG 2005, volume 3678 of LNCS, pages 121-130. Springer, 2005.
    • (2005) In Proc. RECOMB-CG 2005 , vol.3678 , pp. 121-130
    • Sankoff, D.1    Haque, L.2
  • 25
    • 35248841995 scopus 로고    scopus 로고
    • Phylogenetic reconstruction from generearrangement data with unequal gene content
    • J. Tang and B. M. E. Moret. Phylogenetic reconstruction from generearrangement data with unequal gene content. In Proc. WADS 2003, volume 2748 of LNCS, pages 37-46. Springer, 2003.
    • (2003) In Proc. WADS 2003 , vol.2748 , pp. 37-46
    • Tang, J.1    Moret, B.M.E.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.