Sciweavers

3136 search results - page 354 / 628
» Complex networks and evolutionary computation
Sort
View
BMCBI
2010
153views more  BMCBI 2010»
15 years 6 months ago
VITCOMIC: visualization tool for taxonomic compositions of microbial communities based on 16S rRNA gene sequences
Background: Understanding the community structure of microbes is typically accomplished by sequencing 16S ribosomal RNA (16S rRNA) genes. These community data can be represented b...
Hiroshi Mori, Fumito Maruyama, Ken Kurokawa
BMCBI
2010
113views more  BMCBI 2010»
15 years 6 months ago
Efficient protein alignment algorithm for protein search
Background: Proteins show a great variety of 3D conformations, which can be used to infer their evolutionary relationship and to classify them into more general groups; therefore ...
Zaixin Lu, Zhiyu Zhao, Bin Fu
GPEM
2008
128views more  GPEM 2008»
15 years 6 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
JACM
2006
99views more  JACM 2006»
15 years 6 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
187
Voted
JCB
2006
107views more  JCB 2006»
15 years 6 months ago
Maximum Likelihood Molecular Clock Comb: Analytic Solutions
Maximum likelihood (ML) is increasingly used as an optimality criterion for selecting evolutionary trees, but finding the global optimum is a hard computational task. Because no g...
Benny Chor, Amit Khetan, Sagi Snir