메뉴 건너뛰기




Volumn 1, Issue , 2006, Pages 78-83

A self-adaptive ant colony algorithm for phylogenetic tree construction

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; INFORMATION MANAGEMENT; INFORMATION TECHNOLOGY; PROBABILITY DISTRIBUTIONS; TREES (MATHEMATICS);

EID: 34247265519     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICHIT.2006.253468     Document Type: Conference Paper
Times cited : (2)

References (14)
  • 3
    • 26444582827 scopus 로고    scopus 로고
    • An adaptive ant colony algorithm based on equilibrium of distribution
    • C. Ling, S. Jie, and Q. Ling,"An adaptive ant colony algorithm based on equilibrium of distribution," Journal of Software, Vol. 14, 2003, pp. 1148-1151.
    • (2003) Journal of Software , vol.14 , pp. 1148-1151
    • Ling, C.1    Jie, S.2    Ling, Q.3
  • 4
    • 0032951501 scopus 로고    scopus 로고
    • Using genetic algorithms for the construction of phylogenetic trees: Application to G-protein coupled receptor sequences
    • T. H. Reijmers et al., "Using genetic algorithms for the construction of phylogenetic trees: application to G-protein coupled receptor sequences," Biosystems, Vol. 49, 1999, pp. 31-43.
    • (1999) Biosystems , vol.49 , pp. 31-43
    • Reijmers, T.H.1
  • 5
    • 84960450653 scopus 로고    scopus 로고
    • Prokaryote phylogeny without sequence alignment: From avoidance signature to composition distance
    • B. ao and J. Qi, "Prokaryote phylogeny without sequence alignment: from avoidance signature to composition distance," in Proceedings of the 2003 IEEE Bioinformatics Conference, 2003, pp. 375-385.
    • (2003) Proceedings of the 2003 IEEE Bioinformatics Conference , pp. 375-385
    • ao, B.1    Qi, J.2
  • 6
    • 34247256735 scopus 로고    scopus 로고
    • W. Xiaomeng, W. Xiufeng, W. Gang, X. Dong, and L. Guohui, Phylogenetic analysis using complete signature information of whole genomes and clustered neighbor-joining method, Int. J. Bioinformatic and Research and Applications, 2005
    • W. Xiaomeng, W. Xiufeng, W. Gang, X. Dong, and L. Guohui, "Phylogenetic analysis using complete signature information of whole genomes and clustered neighbor-joining method," Int. J. Bioinformatic and Research and Applications, 2005
  • 7
    • 0033759309 scopus 로고    scopus 로고
    • Using traveling salesman problem algorithms for evolutionary tree construction
    • Korostensky, C., Gonnet,G.H.: Using traveling salesman problem algorithms for evolutionary tree construction. Bioinformatics 16 (2002) 619-627.
    • (2002) Bioinformatics , vol.16 , pp. 619-627
    • Korostensky, C.1    Gonnet, G.H.2
  • 10
    • 0000100455 scopus 로고
    • A new challenge for compression algorithms: Genetic sequences
    • S. Grumbach and F. Tahi, "A new challenge for compression algorithms: genetic sequences," Journal of Information Processing Management, Vol. 30. 1994, pp. 875-866
    • (1994) Journal of Information Processing Management , vol.30 , pp. 875-866
    • Grumbach, S.1    Tahi, F.2
  • 11
    • 0023375195 scopus 로고
    • The neighbor-joining method: A new method for reconstructing phylogenetic trees
    • N. Saitou and M. Nei, "The neighbor-joining method: A new method for reconstructing phylogenetic trees," Molecular Biology and Evolution, Vol. 4, 1987, pp. 406-425.
    • (1987) Molecular Biology and Evolution , vol.4 , pp. 406-425
    • Saitou, N.1    Nei, M.2
  • 13
    • 84901470600 scopus 로고    scopus 로고
    • New results on ant-based heuristic for highlighting the organization of large graphs
    • IEEE Press, Piscataway, NJ
    • P. Kuntz and D. Snyder, "New results on ant-based heuristic for highlighting the organization of large graphs," in Proceedings of the 1999 Congress or Evolutionary Computation, IEEE Press, Piscataway, NJ, 1999, pp. 1451-1458
    • (1999) Proceedings of the 1999 Congress or Evolutionary Computation , pp. 1451-1458
    • Kuntz, P.1    Snyder, D.2


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