메뉴 건너뛰기




Volumn 176, Issue 3, 2007, Pages 1908-1917

A tabu search algorithm for maximum parsimony phylogeny inference

Author keywords

Bioinformatics; Maximum parsimony; OR in biology; Phylogeny inference; Tabu search

Indexed keywords

BIOINFORMATICS; MAXIMUM PARSIMONY; PHYLOGENY INFERENCE; TABU SEARCH;

EID: 33750030429     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.10.031     Document Type: Article
Times cited : (15)

References (28)
  • 1
    • 33749995696 scopus 로고    scopus 로고
    • J. Błażewicz, P. Formanowicz, F. Glover, M. Kasprzak, J. We{ogonek}glarz, An improved tabu search algorithm for DNA sequencing with errors, in: Proceedings of the III Meta-heuristics International Conference, Angra dos Reis, 1999, pp. 69-75.
  • 3
    • 84943232323 scopus 로고    scopus 로고
    • Gaphyl: A genetic algorithms approach to cladistics
    • Principles of Data Mining and Knowledge Discovery. DeRaedt L., and Siebes A. (Eds), Springer-Verlag, Berlin
    • Congdon C.B. Gaphyl: A genetic algorithms approach to cladistics. In: DeRaedt L., and Siebes A. (Eds). Principles of Data Mining and Knowledge Discovery. Lecture Notes in Computer Science vol. 2168 (2001), Springer-Verlag, Berlin 67-78
    • (2001) Lecture Notes in Computer Science , vol.2168 , pp. 67-78
    • Congdon, C.B.1
  • 6
    • 33750012825 scopus 로고    scopus 로고
    • A.W.F. Edwards, L.L. Cavalli-Sforza, Reconstruction of evolutionary trees, in: V.H. Heywood, J. McNeill (Eds,), Phenetic and Phylogenetic Classification, Systematics Association Publish, No. 6, London, 1964, pp. 67-76.
  • 7
    • 33749990240 scopus 로고    scopus 로고
    • J. Felsenstein, PHYLIP (phylogeny inference package), Version 3.57c. Distributed by the author, Department of Genetics, University of Washington, Seattle, 1995.
  • 9
    • 84959747425 scopus 로고
    • Toward defining the course of evolution: Minimum change for a specified tree topology
    • Fitch W.M. Toward defining the course of evolution: Minimum change for a specified tree topology. Systematic Zoology 20 (1971) 406-416
    • (1971) Systematic Zoology , vol.20 , pp. 406-416
    • Fitch, W.M.1
  • 10
    • 0002918460 scopus 로고    scopus 로고
    • On the problem of discovering the most parsimonious tree
    • Fitch W.M. On the problem of discovering the most parsimonious tree. American Naturalist 111 (1997) 223-255
    • (1997) American Naturalist , vol.111 , pp. 223-255
    • Fitch, W.M.1
  • 12
    • 0030134790 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with stochastic demands and customers
    • Gendreau M., Laporte G., and Séguin R. A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Operations Research 44 (1996) 469-477
    • (1996) Operations Research , vol.44 , pp. 469-477
    • Gendreau, M.1    Laporte, G.2    Séguin, R.3
  • 13
    • 0033386092 scopus 로고    scopus 로고
    • Phylogenetic analysis of nuclear ribosomal DNA places the nematode parasite, Drechmeria coniospora, in Clavicipitaceae
    • Gernandt D.S., and Stone J.K. Phylogenetic analysis of nuclear ribosomal DNA places the nematode parasite, Drechmeria coniospora, in Clavicipitaceae. Mycologia 91 (1999) 993-1000
    • (1999) Mycologia , vol.91 , pp. 993-1000
    • Gernandt, D.S.1    Stone, J.K.2
  • 14
    • 0033499153 scopus 로고    scopus 로고
    • Analyzing large data sets in reasonable times: Solutions for composite optima
    • Goloboff P.A. Analyzing large data sets in reasonable times: Solutions for composite optima. Cladistics 15 (1999) 415-428
    • (1999) Cladistics , vol.15 , pp. 415-428
    • Goloboff, P.A.1
  • 15
    • 0020308198 scopus 로고
    • Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time
    • Graham R.L., and Foulds L.R. Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time. Mathematical Biosciences 60 (1982) 133-142
    • (1982) Mathematical Biosciences , vol.60 , pp. 133-142
    • Graham, R.L.1    Foulds, L.R.2
  • 16
    • 0020286044 scopus 로고
    • Branch and bound algorithms to determine minimal evolutionary trees
    • Hendy M.D., and Penny D. Branch and bound algorithms to determine minimal evolutionary trees. Mathematical Biosciences 59 (1982) 277-290
    • (1982) Mathematical Biosciences , vol.59 , pp. 277-290
    • Hendy, M.D.1    Penny, D.2
  • 17
    • 84963036271 scopus 로고
    • Quantitative phyletics and the evolution of anurans
    • Kluge A.G., and Farris J.S. Quantitative phyletics and the evolution of anurans. Systematic Zoology 18 (1969) 1-32
    • (1969) Systematic Zoology , vol.18 , pp. 1-32
    • Kluge, A.G.1    Farris, J.S.2
  • 18
    • 0028177080 scopus 로고
    • A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates
    • Kuhner M.K., and Felsenstein J. A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates. Molecular Biology and Evolution 11 (1994) 459-468
    • (1994) Molecular Biology and Evolution , vol.11 , pp. 459-468
    • Kuhner, M.K.1    Felsenstein, J.2
  • 19
    • 0031892789 scopus 로고    scopus 로고
    • A genetic algorithm for maximum-likelihood phylogeny inference using nucleotide sequence data
    • Lewis P.O. A genetic algorithm for maximum-likelihood phylogeny inference using nucleotide sequence data. Molecular Biology and Evolution 15 (1998) 277-283
    • (1998) Molecular Biology and Evolution , vol.15 , pp. 277-283
    • Lewis, P.O.1
  • 20
    • 0003421005 scopus 로고    scopus 로고
    • Sinauer Associates, Boston, MA
    • Li W.H. Molecular Evolution (1997), Sinauer Associates, Boston, MA
    • (1997) Molecular Evolution
    • Li, W.H.1
  • 21
    • 0010681391 scopus 로고
    • Applications of the annealing algorithm to combinatorial problems in statistics
    • Lundy M. Applications of the annealing algorithm to combinatorial problems in statistics. Biometrika 72 (1985) 191-198
    • (1985) Biometrika , vol.72 , pp. 191-198
    • Lundy, M.1
  • 22
    • 0030309199 scopus 로고    scopus 로고
    • H. Matsuda, Protein phylogenetic inference using maximum likelihood with a genetic algorithm, in: Pacific Symposium on Biocomputing, 1996, pp. 512-523.
  • 23
    • 0032906031 scopus 로고    scopus 로고
    • Bayesian phylogenetic inference via Markov chain Monte Carlo methods
    • Mau B., Newton M.A., and Larget B. Bayesian phylogenetic inference via Markov chain Monte Carlo methods. Biometrics 55 (1999) 1-12
    • (1999) Biometrics , vol.55 , pp. 1-12
    • Mau, B.1    Newton, M.A.2    Larget, B.3
  • 25
    • 0023375195 scopus 로고
    • The neighbor-joining method: A new method for reconstruction phylogenetic trees
    • Saitou N., and Nei M. The neighbor-joining method: A new method for reconstruction phylogenetic trees. Molecular Biology and Evolution 4 (1987) 406-425
    • (1987) Molecular Biology and Evolution , vol.4 , pp. 406-425
    • Saitou, N.1    Nei, M.2
  • 27
    • 0038560433 scopus 로고    scopus 로고
    • Tabu search on the geometric traveling salesman problem
    • Osman I.H., and Kelly J.P. (Eds), Kluwer Academic Publishers, Boston
    • Zachariasen M., and Dam M. Tabu search on the geometric traveling salesman problem. In: Osman I.H., and Kelly J.P. (Eds). Meta-heuristics: Theory and Applications (1996), Kluwer Academic Publishers, Boston 571-587
    • (1996) Meta-heuristics: Theory and Applications , pp. 571-587
    • Zachariasen, M.1    Dam, M.2
  • 28
    • 0002331493 scopus 로고
    • Molecular disease evolution and genetic heterogeneity
    • Marsha M., and Pullman B. (Eds), Academic Press
    • Zuckerkandl E., and Pauling L. Molecular disease evolution and genetic heterogeneity. In: Marsha M., and Pullman B. (Eds). Horizons in Biochemistry (1962), Academic Press 189-225
    • (1962) Horizons in Biochemistry , pp. 189-225
    • Zuckerkandl, E.1    Pauling, L.2


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