Sciweavers

1763 search results - page 344 / 353
» Dependent random choice
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
BMCBI
2010
149views more  BMCBI 2010»
13 years 7 months ago
KID - an algorithm for fast and efficient text mining used to automatically generate a database containing kinetic information o
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
Stephanie Heinen, Bernhard Thielen, Dietmar Schomb...
BMCBI
2008
138views more  BMCBI 2008»
13 years 7 months ago
Information transfer in signaling pathways: A study using coupled simulated and experimental data
Background: The topology of signaling cascades has been studied in quite some detail. However, how information is processed exactly is still relatively unknown. Since quite divers...
Jürgen Pahle, Anne K. Green, C. Jane Dixon, U...
BMCBI
2010
139views more  BMCBI 2010»
13 years 7 months ago
A global optimization algorithm for protein surface alignment
Background: A relevant problem in drug design is the comparison and recognition of protein binding sites. Binding sites recognition is generally based on geometry often combined w...
Paola Bertolazzi, Concettina Guerra, Giampaolo Liu...
BMCBI
2008
78views more  BMCBI 2008»
13 years 7 months ago
Evaluation of time profile reconstruction from complex two-color microarray designs
Background: As an alternative to the frequently used "reference design" for two-channel microarrays, other designs have been proposed. These designs have been shown to b...
Ana C. Fierro, Raphael Thuret, Kristof Engelen, Gi...