메뉴 건너뛰기
Bioinformatics
Volumn 21, Issue 6, 2005, Pages 817-820
ParlS genome rearrangement server
Author keywords

[No Author keywords available]
Indexed keywords

ACCESS TO INFORMATION; ANALYTIC METHOD; ARTICLE; BAYES THEOREM; CHROMOSOME; COMPUTER GRAPHICS; COMPUTER MODEL; COMPUTER SYSTEM; DNA TRANSPOSITION; GENE LOCATION; GENE MUTATION; GENE NUMBER; GENE ORDER; GENE REARRANGEMENT; GENETIC DATABASE; GENETIC TRANSFORMATION; GENOME ANALYSIS; HUMAN COMPUTER INTERACTION; INTERNET; MITOCHONDRION; MOLECULAR SIZE; PRIORITY JOURNAL; PROBABILITY; ALGORITHM; CHROMOSOME ABERRATION; CHROMOSOME MAP; COMPUTER PROGRAM; DNA SEQUENCE; METHODOLOGY; NUCLEOTIDE SEQUENCE;
EID: 15944402451     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/bti060     Document Type: Article
Times cited : (8)
References (8)
  • 1
  • 2
    • 84959044488 scopus 로고    scopus 로고
    • (1 + E)-Approximation of sorting by reversals and transpositions
    • University of Aarhus, Denmark, LNCS 2149
    • Eriksen,N. (2001) (1 + E)-Approximation of sorting by reversals and transpositions. In Proceedings of WABI2001 BRICS, University of Aarhus, Denmark, LNCS 2149, pp. 227-237.
    • (2001) Proceedings of WABI2001 BRICS , pp. 227-237
    • Eriksen, N.1
  • 3
    • 0000840830 scopus 로고    scopus 로고
    • A 2-approximation algorithm for genome rearrangements by reversals and transpositions
    • Gu,Q.-P., Peng,S. and Sudborough,I.H. (1999) A 2-approximation algorithm for genome rearrangements by reversals and transpositions. Theoret. Comput. Sci., 210, 327-339.
    • (1999) Theoret. Comput. Sci. , vol.210 , pp. 327-339
    • Gu, Q.-P.1    Peng, S.2    Sudborough, I.H.3
  • 4
    • 15944377972 scopus 로고    scopus 로고
    • Polynomial algorithm for computing translocation distance between genomes
    • CA
    • Hannenhalli,S. (1996) Polynomial algorithm for computing translocation distance between genomes. In Proceedings of CPM1996, CA, pp. 168-185.
    • (1996) Proceedings of CPM1996 , pp. 168-185
    • Hannenhalli, S.1
  • 5
    • 0002856077 scopus 로고    scopus 로고
    • Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals
    • Hannenhalli,S. and Pevzner,P.A. (1999) Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM, 46, 1-27.
    • (1999) J. ACM , vol.46 , pp. 1-27
    • Hannenhalli, S.1    Pevzner, P.A.2
  • 6
    • 0036434711 scopus 로고    scopus 로고
    • Bayesian phylogenetic inference from animal mitochondrial genome arrangements
    • Larget,B., Simon,D.L. and Kadane,J.B. (2002) Bayesian phylogenetic inference from animal mitochondrial genome arrangements. J. R. Stat. Soc. B., 64, 681-695.
    • (2002) J. R. Stat. Soc. B. , vol.64 , pp. 681-695
    • Larget, B.1    Simon, D.L.2    Kadane, J.B.3
  • 7
    • 0344362588 scopus 로고    scopus 로고
    • MCMC genome rearrangement
    • Miklós,I. (2003) MCMC genome rearrangement. Bioinformatics, 19, ii130-ii137.
    • (2003) Bioinformatics , vol.19
    • Miklós, I.1
  • 8
    • 0036211065 scopus 로고    scopus 로고
    • GRIMM: Genome rearrangements web server
    • Tessler,G. (2002) GRIMM: genome rearrangements web server. Bioinformatics, 18, 492-493.
    • (2002) Bioinformatics , vol.18 , pp. 492-493
    • Tessler, G.1

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