Sciweavers

6274 search results - page 267 / 1255
» From query complexity to computational complexity
Sort
View
BMCBI
2010
142views more  BMCBI 2010»
15 years 6 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...
BMCBI
2008
81views more  BMCBI 2008»
15 years 6 months ago
A perspective for biomedical data integration: Design of databases for flow cytometry
Background: The integration of biomedical information is essential for tackling medical problems. We describe a data model in the domain of flow cytometry (FC) allowing for massiv...
John Drakos, Marina Karakantza, Nicholas C. Zoumbo...
ESOP
2009
Springer
15 years 10 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
CEC
2010
IEEE
15 years 7 months ago
Optimization of biogas production with computational intelligence a comparative study
Biogas plants are reliable sources of energy based on renewable materials including organic waste. There is a high demand from industry to run these plants efficiently, which lead...
Jörg Ziegenhirt, Thomas Bartz-Beielstein, Oli...
ICDE
2010
IEEE
273views Database» more  ICDE 2010»
16 years 6 months ago
WikiAnalytics: Ad-hoc Querying of Highly Heterogeneous Structured Data
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
Andrey Balmin, Emiran Curtmola