Sciweavers

3113 search results - page 580 / 623
» Numerical Methods
Sort
View
134
Voted
BMCBI
2006
143views more  BMCBI 2006»
15 years 2 months ago
Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
Christophe Dessimoz, Manuel Gil, Adrian Schneider,...
BMCBI
2007
166views more  BMCBI 2007»
15 years 2 months ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour
152
Voted
BMCBI
2007
153views more  BMCBI 2007»
15 years 2 months ago
Lower bounds on multiple sequence alignment using exact 3-way alignment
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
Charles J. Colbourn, Sudhir Kumar
147
Voted
ISCI
2008
165views more  ISCI 2008»
15 years 2 months ago
Support vector regression from simulation data and few experimental samples
This paper considers nonlinear modeling based on a limited amount of experimental data and a simulator built from prior knowledge. The problem of how to best incorporate the data ...
Gérard Bloch, Fabien Lauer, Guillaume Colin...
143
Voted
JSAT
2008
122views more  JSAT 2008»
15 years 2 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya