메뉴 건너뛰기




Volumn 3537, Issue , 2005, Pages 116-127

The median problem for the reversal distance in circular bacterial genomes

Author keywords

[No Author keywords available]

Indexed keywords

BACTERIA; GENES; PROBLEM SOLVING;

EID: 26444512111     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496656_11     Document Type: Conference Paper
Times cited : (9)

References (19)
  • 1
    • 0034767147 scopus 로고    scopus 로고
    • A linear-time algorithm for computing inversion distance between signed permutations with an experimental study
    • D.A. Bader, B.M.E. Moret, and M. Yan. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. Journal of Computational Biology, 8:483-491, 2001.
    • (2001) Journal of Computational Biology , vol.8 , pp. 483-491
    • Bader, D.A.1    Moret, B.M.E.2    Yan, M.3
  • 2
    • 35048854107 scopus 로고    scopus 로고
    • Reversal distance without hurdles and fortresses
    • Proc. 15th Annual Symposium on Combinatorial Pattern Matching. Springer-Verlag
    • A. Bergeron, J. Mixtacki, and J. Stoye. Reversal distance without hurdles and fortresses. In Proc. 15th Annual Symposium on Combinatorial Pattern Matching, volume 3109 of Lecture Notes in Computer Science, pages 388-399. Springer-Verlag, 2004.
    • (2004) Lecture Notes in Computer Science , vol.3109 , pp. 388-399
    • Bergeron, A.1    Mixtacki, J.2    Stoye, J.3
  • 4
    • 0036143403 scopus 로고    scopus 로고
    • Genome-scale evolution: Reconstructing gene orders in the ancestral species
    • B. Bourque and P.A. Pevzner. Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Research, 12(1):26-36, 2002.
    • (2002) Genome Research , vol.12 , Issue.1 , pp. 26-36
    • Bourque, B.1    Pevzner, P.A.2
  • 6
    • 84959064166 scopus 로고    scopus 로고
    • On the practical solution of the reversal median problem
    • Proc. 1st International Workshop on Algorithms in Bioinformatics. Springer-Verlag
    • A. Caprara. On the practical solution of the reversal median problem. In Proc. 1st International Workshop on Algorithms in Bioinformatics, volume 2149 of Lecture Notes in Computer Science, pages 238-251. Springer-Verlag, 2001.
    • (2001) Lecture Notes in Computer Science , vol.2149 , pp. 238-251
    • Caprara, A.1
  • 7
    • 0002835359 scopus 로고
    • Inversions in the chromosomes of Drosophila pseudoobscura
    • T. Dobzhansky and A.H. Sturtevant. Inversions in the chromosomes of Drosophila pseudoobscura. Genetics, 23:28-64, 1938.
    • (1938) Genetics , vol.23 , pp. 28-64
    • Dobzhansky, T.1    Sturtevant, A.H.2
  • 8
    • 0034568798 scopus 로고    scopus 로고
    • Evidence for symmetric chromosomal inversions around the replication origin in bacteria
    • J.A. Eisen, J.F. Heidelberg, O. White, and S.L. Salzberg. Evidence for symmetric chromosomal inversions around the replication origin in bacteria. Genome Biology, 1(6): 1-9, 2000.
    • (2000) Genome Biology , vol.1 , Issue.6 , pp. 1-9
    • Eisen, J.A.1    Heidelberg, J.F.2    White, O.3    Salzberg, S.L.4
  • 9
    • 0002856077 scopus 로고    scopus 로고
    • Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals)
    • S. Hannenhalli and P.A. Pevzner. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Journal of the ACM, 48:1-27, 1999.
    • (1999) Journal of the ACM , vol.48 , pp. 1-27
    • Hannenhalli, S.1    Pevzner, P.A.2
  • 10
    • 33746683240 scopus 로고    scopus 로고
    • Evaluating genome dynamics: The constraints on rearrangements within bacterial genomes
    • D. Hughes. Evaluating genome dynamics: The constraints on rearrangements within bacterial genomes. Genome Biology, 1(6): 1-8, 2000.
    • (2000) Genome Biology , vol.1 , Issue.6 , pp. 1-8
    • Hughes, D.1
  • 11
    • 0033295439 scopus 로고    scopus 로고
    • A faster and simpler algorithm for sorting signed permutations by reversals
    • H. Kaplan, R. Shamir, and R.E. Tarjan. A faster and simpler algorithm for sorting signed permutations by reversals. SIAM J. Comput., 29(3):880-892, 1999.
    • (1999) SIAM J. Comput. , vol.29 , Issue.3 , pp. 880-892
    • Kaplan, H.1    Shamir, R.2    Tarjan, R.E.3
  • 12
    • 84957042462 scopus 로고    scopus 로고
    • Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data
    • Proc. 2nd International Workshop on Algorithms in Bioinformatics. Springer-Verlag
    • B.M.E. Moret, A.C. Siepel, J. Tang, and T. Liu. Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data. In Proc. 2nd International Workshop on Algorithms in Bioinformatics, volume 2542 of Lecture Notes in Computer Science, pages 521-536. Springer-Verlag, 2002.
    • (2002) Lecture Notes in Computer Science , vol.2542 , pp. 521-536
    • Moret, B.M.E.1    Siepel, A.C.2    Tang, J.3    Liu, T.4
  • 14
    • 4544280334 scopus 로고    scopus 로고
    • The median problems for breakpoints are NP-complete
    • Electronic Colloquium on Computational Complexity
    • I. Pe'er and R. Shamir. The median problems for breakpoints are NP-complete. Technical Report TR98-071, Electronic Colloquium on Computational Complexity, 1998.
    • (1998) Technical Report , vol.TR98-071
    • Pe'er, I.1    Shamir, R.2
  • 15
    • 84957615807 scopus 로고
    • Edit distance for genome comparison based on non-local operations
    • Proc. 3rd Annual Symposium on Combinatorial Pattern Matching, 3rd Annual Symposium. Springer-Verlag
    • D. Sankoff. Edit distance for genome comparison based on non-local operations. In Proc. 3rd Annual Symposium on Combinatorial Pattern Matching, 3rd Annual Symposium, volume 644 of Lecture Notes in Computer Science, pages 121-135. Springer-Verlag, 1992.
    • (1992) Lecture Notes in Computer Science , vol.644 , pp. 121-135
    • Sankoff, D.1
  • 16
    • 0031721577 scopus 로고    scopus 로고
    • Multiple genome rearrangement and breakpoint phylogeny
    • D. Sankoff and M. Blanchette. Multiple genome rearrangement and breakpoint phylogeny. Journal of Computational Biology, 5(3):555-570, 1998.
    • (1998) Journal of Computational Biology , vol.5 , Issue.3 , pp. 555-570
    • Sankoff, D.1    Blanchette, M.2
  • 17
    • 84959066123 scopus 로고    scopus 로고
    • Finding an optimal inversion median: Experimental results
    • Proc. 1st International Workshop on Algorithms in Bioinformatics. Springer-Verlag
    • A.C. Siepel and B.M.E. Moret. Finding an optimal inversion median: Experimental results. In Proc. 1st International Workshop on Algorithms in Bioinformatics, volume 2149 of Lecture Notes in Computer Science, pages 189-203. Springer-Verlag, 2001.
    • (2001) Lecture Notes in Computer Science , vol.2149 , pp. 189-203
    • Siepel, A.C.1    Moret, B.M.E.2
  • 18
    • 0033776631 scopus 로고    scopus 로고
    • Genome rearrangement by replication-directed translocation
    • E.R.M. Tiller and R. Collins. Genome rearrangement by replication-directed translocation. Nature Genetics, 26:195-197, 2000.
    • (2000) Nature Genetics , vol.26 , pp. 195-197
    • Tiller, E.R.M.1    Collins, R.2


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