148 search results - page 21 / 30 » Constructing Big Trees from Short Sequences |
SODA
1998
ACM
15 years 9 days ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
BMCBI
2006
14 years 11 months ago
2006
Background: Molecular evolutionary studies of noncoding sequences rely on multiple alignments. Yet how multiple alignment accuracy varies across sequence types, tree topologies, d...
102
click to vote
IJCNN
2000
IEEE
15 years 3 months ago
2000
IEEE
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
NMR
2004
Springer
15 years 4 months ago
2004
Springer
In this paper, we introduce a new method to recover from discrepancies in a general monitoring framework where the agent finds some explanations (points of failure) for discrepan...
HEURISTICS
2008
14 years 11 months ago
2008
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...