Sciweavers

42230 search results - page 8387 / 8446
» Algorithms and Complexity Results for
Sort
View
BMCBI
2005
97views more  BMCBI 2005»
13 years 8 months ago
Clustering the annotation space of proteins
Background: Current protein clustering methods rely on either sequence or functional similarities between proteins, thereby limiting inferences to one of these areas. Results: Her...
Victor Kunin, Christos A. Ouzounis
BMCBI
2005
151views more  BMCBI 2005»
13 years 8 months ago
stam - a Bioconductor compliant R package for structured analysis of microarray data
Background: Genome wide microarray studies have the potential to unveil novel disease entities. Clinically homogeneous groups of patients can have diverse gene expression profiles...
Claudio Lottaz, Rainer Spang
BMCBI
2005
147views more  BMCBI 2005»
13 years 8 months ago
GATA: a graphic alignment tool for comparative sequence analysis
Background: Several problems exist with current methods used to align DNA sequences for comparative sequence analysis. Most dynamic programming algorithms assume that conserved se...
David A. Nix, Michael B. Eisen
BMCBI
2005
141views more  BMCBI 2005»
13 years 8 months ago
A method for the prediction of GPCRs coupling specificity to G-proteins using refined profile Hidden Markov Models
Background: G- Protein coupled receptors (GPCRs) comprise the largest group of eukaryotic cell surface receptors with great pharmacological interest. A broad range of native ligan...
Nikolaos G. Sgourakis, Pantelis G. Bagos, Panagiot...
TKDE
2008
153views more  TKDE 2008»
13 years 8 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang
« Prev « First page 8387 / 8446 Last » Next »