Sciweavers

16430 search results - page 132 / 3286
» On Computable Tree Functions
Sort
View
92
Voted
MST
1998
61views more  MST 1998»
15 years 3 months ago
Functions Computable with Nonadaptive Queries to NP
Harry Buhrman, Jim Kadin, Thomas Thierauf
139
Voted
BMCBI
2006
107views more  BMCBI 2006»
15 years 3 months ago
Simplifying gene trees for easier comprehension
Background: In the genomic age, gene trees may contain large amounts of data making them hard to read and understand. Therefore, an automated simplification is important. Results:...
Paul-Ludwig Lott, Marvin Mundry, Christoph Sassenb...
CORR
2010
Springer
91views Education» more  CORR 2010»
15 years 3 months ago
Simulations of Weighted Tree Automata
Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called f...
Zoltán Ésik, Andreas Maletti