메뉴 건너뛰기




Volumn 1, Issue , 2005, Pages 363-378

Computing the assignment of orthologous genes via genome rearrangement

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; DNA SEQUENCES; EVOLUTIONARY ALGORITHMS; HEURISTIC ALGORITHMS;

EID: 84863067228     PISSN: 17516404     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1142/9781860947322_0037     Document Type: Conference Paper
Times cited : (38)

References (21)
  • 1
    • 0014800108 scopus 로고
    • Distinguishing homologous from analogous proteins
    • W.M. Fitch. Distinguishing homologous from analogous proteins. Syst. Zool. 19, pp.99-113, 1970.
    • (1970) Syst. Zool. , vol.19 , pp. 99-113
    • Fitch, W.M.1
  • 2
    • 30344457925 scopus 로고    scopus 로고
    • Orthology, paralogy and proposed classification for paralog subtypes
    • E. Sonnhammer and E. Koonin. Orthology, paralogy and proposed classification for paralog subtypes. Trends Genet. 16, pp.227-231, 2000.
    • (2000) Trends Genet. , vol.16 , pp. 227-231
    • Sonnhammer, E.1    Koonin, E.2
  • 3
    • 0033391532 scopus 로고    scopus 로고
    • Genome rearrangement with gene families
    • D. Sankoff. Genome rearrangement with gene families. Bioinformatics, 15(11): 909-917, 1999. (Pubitemid 30103161)
    • (1999) Bioinformatics , vol.15 , Issue.11 , pp. 909-917
    • Sankoff, D.1
  • 4
    • 0030660581 scopus 로고    scopus 로고
    • A genomic perspective on protein families
    • R.L. Tatusov, E.V. Koonin and D.J. Lipman. A genomic perspective on protein families. Science 278: 631-637.
    • Science , vol.278 , pp. 631-637
    • Tatusov, R.L.1    Koonin, E.V.2    Lipman, D.J.3
  • 5
    • 0033956060 scopus 로고    scopus 로고
    • The COG database: A tool for genome-scale analysis of protein functions and evolution
    • R.L. Tatusov, M.Y. Galperin, D.A. Natale and E.V. Koonin. The COG database: A tool for genome-scale analysis of protein functions and evolution. Nucleic Acids Res. 28: 33-36, 2000. (Pubitemid 30047708)
    • (2000) Nucleic Acids Research , vol.28 , Issue.1 , pp. 33-36
    • Tatusov, R.L.1    Galperin, M.Y.2    Natale, D.A.3    Koonin, E.V.4
  • 6
    • 0035861990 scopus 로고    scopus 로고
    • Automatic clustering of orthologs and in-paralogs from pairwise species comparisons
    • DOI 10.1006/jmbi.2000.5197
    • M. Remm, C. Storm and E. Sonnhammer. Automatic clustering of orthologs and in-paralogs from pairwise species comparisons. J. Mol. Biol., 314, pp.1041-1052, 2001. (Pubitemid 34073068)
    • (2001) Journal of Molecular Biology , vol.314 , Issue.5 , pp. 1041-1052
    • Remm, M.1    Storm, C.E.V.2    Sonnhammer, E.L.L.3
  • 8
    • 0001807019 scopus 로고
    • Transforming cabbage into turnip (Polynomial algorithm for sorting signed permutations by reversals)
    • S. Hannenhalli and P. Pevzner. Transforming cabbage into turnip (Polynomial algorithm for sorting signed permutations by reversals). Proc. 27th Annual ACM Symposium on the Theory of Computing. pp.178-187, 1995.
    • (1995) Proc. 27th Annual ACM Symposium on the Theory of Computing , pp. 178-187
    • Hannenhalli, S.1    Pevzner, P.2
  • 9
    • 0031876458 scopus 로고    scopus 로고
    • Towards detection of orthologues in sequence databases
    • Y.P. Yuan, O. Eulenstein, M. Vingron and P. Bork. Towards detection of orthologues in sequence databases. Bioinformatics, 14(3), pp.285-289, 1998. (Pubitemid 28395865)
    • (1998) Bioinformatics , vol.14 , Issue.3 , pp. 285-289
    • Yuan, Y.P.1    Eulenstein, O.2    Vingron, M.3    Bork, P.4
  • 10
    • 0036173130 scopus 로고    scopus 로고
    • Automated ortholog inference from phylogenetic trees and calculation of orthology reliability
    • C. Storm and E. Sonnhammer. Automated ortholog inference from phylogenetic trees and calculation of orthology reliability. Bioinformatics, 18(1), 2002.
    • (2002) Bioinformatics , vol.18 , Issue.1
    • Storm, C.1    Sonnhammer, E.2
  • 11
    • 0642340503 scopus 로고    scopus 로고
    • OrtholParaMap: Distinguishing orthologs from paralogs by integrating comparative genome data and gene phylogenies
    • S.B. Cannon and N.D. Young. OrtholParaMap: distinguishing orthologs from paralogs by integrating comparative genome data and gene phylogenies. BMC Bioinformatics, 4(1):35, 2003.
    • (2003) BMC Bioinformatics , vol.4 , Issue.1 , pp. 35
    • Cannon, S.B.1    Young, N.D.2
  • 13
    • 0034767147 scopus 로고    scopus 로고
    • A linear-time algorithm for computing inversion distance between signed permutations with an experimental study
    • DOI 10.1089/106652701753216503
    • D. Bader, B. Moret and M. Yan. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. Journal of Computational Biology, 8(5):483-491, 2001. (Pubitemid 33044073)
    • (2001) Journal of Computational Biology , vol.8 , Issue.5 , pp. 483-491
    • Bader, D.A.1    Moret, B.M.E.2    Yan, M.3
  • 14
    • 0037749492 scopus 로고    scopus 로고
    • Reconstructing an ancestral genome using minimum segments duplications and reversals
    • DOI 10.1016/S0022-0000(02)00003-X, PII S002200000200003X
    • N. El-Mabrouk. Reconstructing an ancestral genome using minimum segments duplications and reversals. Journal of Computer and System Sciences, 65, pp.442-464, 2002. (Pubitemid 41161949)
    • (2003) Journal of Computer and System Sciences , vol.65 , Issue.3 , pp. 442-464
    • El-Mabrouk, N.1
  • 16
    • 0029184821 scopus 로고
    • Linear space algorithms that build local alignments from fragments
    • K. Chao and W. Miller. Linear space algorithms that build local alignments from fragments. Algorithmica, 13: 106-134, 1995.
    • (1995) Algorithmica , vol.13 , pp. 106-134
    • Chao, K.1    Miller, W.2
  • 17
    • 0242659445 scopus 로고    scopus 로고
    • Sorting strings by reversals and by transpositions
    • DOI 10.1137/S0895480197331995, PII S0895480197331995
    • D. Christie and R. Irving. Sorting strings by reversals and by transpositions. SIAM J. Discrete Math. Vol. 14(2). pp.193-206, 2001. (Pubitemid 33701228)
    • (2001) SIAM Journal on Discrete Mathematics , vol.14 , Issue.2 , pp. 193-206
    • Christie, D.A.1    Irving, R.W.2
  • 18
    • 84863042148 scopus 로고    scopus 로고
    • Minimum common string partition problem: Hardness and approximations
    • Accepted by
    • A. Goldstein, P. Kolman and J. Zheng. Minimum common string partition problem: hardness and approximations. Accepted by ISAAC'04, 2004.
    • (2004) ISAAC'04
    • Goldstein, A.1    Kolman, P.2    Zheng, J.3
  • 19
    • 0002721941 scopus 로고    scopus 로고
    • Sorting permutations by reversals and Eulerian cycle decompositions
    • A. Caprara. Sorting permutations by reversals and Eulerian cycle decompositions. SIAM J. Discrete Math. Vol. 12(1), pp.91-110, 1999.
    • (1999) SIAM J. Discrete Math. , vol.12 , Issue.1 , pp. 91-110
    • Caprara, A.1
  • 20
    • 0037264074 scopus 로고    scopus 로고
    • Genome rearrangements in mammalian evolution: Lessons from human and mouse genomes
    • P. Pevzner and G. Tesler. Genome rearrangements in mammalian evolution: lessons from human and mouse genomes. Genome Research, 13: 37-45, 2003.
    • (2003) Genome Research , vol.13 , pp. 37-45
    • Pevzner, P.1    Tesler, G.2


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