Sciweavers

712 search results - page 67 / 143
» The Complexity of Constructing Evolutionary Trees Using Expe...
Sort
View
SIROCCO
2008
15 years 4 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
BMCBI
2006
120views more  BMCBI 2006»
15 years 3 months ago
Integrating protein structures and precomputed genealogies in the Magnum database: Examples with cellular retinoid binding prote
Background: When accurate models for the divergent evolution of protein sequences are integrated with complementary biological information, such as folded protein structures, anal...
Michael E. Bradley, Steven A. Benner
AIIA
2007
Springer
15 years 7 months ago
Advanced Tree-Based Kernels for Protein Classification
One of the aims of modern Bioinformatics is to discover the molecular mechanisms that rule the protein operation. This would allow us to understand the complex processes involved i...
Elisa Cilia, Alessandro Moschitti
DMIN
2007
158views Data Mining» more  DMIN 2007»
15 years 4 months ago
Mining Frequent Itemsets Using Re-Usable Data Structure
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
Mohamed Yakout, Alaaeldin M. Hafez, Hussein Aly
IJCNN
2007
IEEE
15 years 9 months ago
Branching Principal Components: Elastic Graphs, Topological Grammars and Metro Maps
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...