Sciweavers

3702 search results - page 355 / 741
» All Pairings Are in a Group
Sort
View
BMCBI
2008
97views more  BMCBI 2008»
15 years 7 months ago
Interrogating domain-domain interactions with parsimony based approaches
Background: The identification and characterization of interacting domain pairs is an important step towards understanding protein interactions. In the last few years, several met...
Katia S. Guimarães, Teresa M. Przytycka
CORR
2010
Springer
200views Education» more  CORR 2010»
15 years 7 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
194
Voted
DC
2008
15 years 7 months ago
Fast computation by population protocols with a leader
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
Dana Angluin, James Aspnes, David Eisenstat
179
Voted
BMCBI
2007
101views more  BMCBI 2007»
15 years 6 months ago
Robust detection and verification of linear relationships to generate metabolic networks using estimates of technical errors
Background: The size and magnitude of the metabolome, the ratio between individual metabolites and the response of metabolic networks is controlled by multiple cellular factors. A...
Frank Kose, Jan Budczies, Matthias Holschneider, O...
189
Voted
BMCBI
2007
131views more  BMCBI 2007»
15 years 6 months ago
An improved method for identifying functionally linked proteins using phylogenetic profiles
Background: Phylogenetic profiles record the occurrence of homologs of genes across fully sequenced organisms. Proteins with similar profiles are typically components of protein c...
Shawn Cokus, Sayaka Mizutani, Matteo Pellegrini