메뉴 건너뛰기




Volumn 4, Issue 4, 2007, Pages 523-534

Comparing genomes with duplications: A computational complexity point of view

Author keywords

Common intervals; Comparative genomics; Computational complexity; Maximum adjacency disruption number; Summed adjacency disruption number

Indexed keywords

BIOMARKERS; COMPUTATIONAL COMPLEXITY; GENETIC ENGINEERING; MATHEMATICAL MODELS;

EID: 36248935185     PISSN: 15455963     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCBB.2007.1069     Document Type: Conference Paper
Times cited : (28)

References (28)
  • 1
    • 0033391532 scopus 로고    scopus 로고
    • Genome Rearrangement with Gene Families
    • D. Sankoff, "Genome Rearrangement with Gene Families," Bioinformatics, vol. 15, no. 11, pp. 909-917, 1999.
    • (1999) Bioinformatics , vol.15 , Issue.11 , pp. 909-917
    • Sankoff, D.1
  • 3
  • 4
    • 12744263078 scopus 로고    scopus 로고
    • Comparative Architectures of Mammalian and Chicken Genomes Reveal Highly Variable Rates of Genomic Rearrangements across Different Lineages
    • G. Bourque, E. Zdobnov, P. Bork, P. Pevzner, and G. Tesler, "Comparative Architectures of Mammalian and Chicken Genomes Reveal Highly Variable Rates of Genomic Rearrangements across Different Lineages," Genome Research, vol. 15, no. 1, pp. 98-110, 2005.
    • (2005) Genome Research , vol.15 , Issue.1 , pp. 98-110
    • Bourque, G.1    Zdobnov, E.2    Bork, P.3    Pevzner, P.4    Tesler, G.5
  • 6
    • 0036499057 scopus 로고    scopus 로고
    • Shot: A Web Server for the Construction of Genome Phytogenies
    • J. Korbel, D. Snel, M. Huynen, and P. Bork, "Shot: A Web Server for the Construction of Genome Phytogenies," Trends in Genetics, vol. 18, no. 3, pp. 158-162, 2002.
    • (2002) Trends in Genetics , vol.18 , Issue.3 , pp. 158-162
    • Korbel, J.1    Snel, D.2    Huynen, M.3    Bork, P.4
  • 7
    • 19544374490 scopus 로고    scopus 로고
    • Genome Rearrangement Distances and Gene Order Phylogeny in 7-Proteobacteria
    • E. Belda, A. Moya, and F. Silva, "Genome Rearrangement Distances and Gene Order Phylogeny in 7-Proteobacteria," Molecular Biology Evolution, vol. 22, no. 6, pp. 1456-1467, 2005.
    • (2005) Molecular Biology Evolution , vol.22 , Issue.6 , pp. 1456-1467
    • Belda, E.1    Moya, A.2    Silva, F.3
  • 12
    • 34250336698 scopus 로고    scopus 로고
    • Algorithms for Calculating Exemplar Distances
    • honours Year Project Report, Nat'l Univ. of Singapore
    • N.C. Thach, "Algorithms for Calculating Exemplar Distances," honours Year Project Report, Nat'l Univ. of Singapore, 2005.
    • (2005)
    • Thach, N.C.1
  • 14
    • 4544242008 scopus 로고    scopus 로고
    • Genomic Distances under Deletions and Insertions
    • M. Marron, K. Swenson, and B. Moret, "Genomic Distances under Deletions and Insertions," Theoretical Computer Science, vol. 325, no. 3, pp. 347-360, 2004.
    • (2004) Theoretical Computer Science , vol.325 , Issue.3 , pp. 347-360
    • Marron, M.1    Swenson, K.2    Moret, B.3
  • 17
    • 19544362070 scopus 로고    scopus 로고
    • Divide-and-Conquer Approach for the Exemplar Breakpoint Distance
    • C. Nguyen, Y. Tay, and L. Zhang, "Divide-and-Conquer Approach for the Exemplar Breakpoint Distance," Bioinformatics, vol. 21, no. 10, pp. 2171-2176, 2005.
    • (2005) Bioinformatics , vol.21 , Issue.10 , pp. 2171-2176
    • Nguyen, C.1    Tay, Y.2    Zhang, L.3
  • 26
    • 0032108328 scopus 로고    scopus 로고
    • A Threshold of ln(n) for Approximating Set Cover
    • U. Feige, "A Threshold of ln(n) for Approximating Set Cover," J. ACM, vol. 4, no. 45, pp. 634-652, 1998.
    • (1998) J. ACM , vol.4 , Issue.45 , pp. 634-652
    • Feige, U.1
  • 27


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