Sciweavers

3146 search results - page 602 / 630
» Efficient Consequence Finding
Sort
View
ALMOB
2008
131views more  ALMOB 2008»
13 years 7 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
ASC
2010
13 years 7 months ago
Genotype representations in grammatical evolution
Grammatical evolution (GE) is a form of grammar-based genetic programming. A particular feature of GE is that it adopts a distinction between the genotype and phenotype similar to...
Jonatan Hugosson, Erik Hemberg, Anthony Brabazon, ...
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
13 years 7 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
13 years 7 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
BMCBI
2010
132views more  BMCBI 2010»
13 years 7 months ago
Protein docking by Rotation-Based Uniform Sampling (RotBUS) with fast computing of intermolecular contact distance and residue d
Background: Protein-protein interactions are fundamental for the majority of cellular processes and their study is of enormous biotechnological and therapeutic interest. In recent...
Albert Solernou, Juan Fernández-Recio