4095 search results - page 323 / 819 » How to test a tree |
106
Voted
BMCBI
2004
15 years 28 days ago
2004
Background: The prediction of ancestral protein sequences from multiple sequence alignments is useful for many bioinformatics analyses. Predicting ancestral sequences is not a sim...
STACS
2010
Springer
15 years 8 months ago
2010
Springer
Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k = 3. We show how to solve this problem in polynomial t...
89
Voted
AMC
2007
15 years 1 months ago
2007
This short note explains how to use ready-to-use components of symbolic software to convert between the free cumulants and the moments of measures without sophisticated programming...
111
Voted
ENTCS
2006
15 years 1 months ago
2006
We build a realizability model for linear logic using a name-passing process calculus. The construction is based on testing semantics for processes, drawing ideas from spatial and...
IIE
2006
15 years 1 months ago
2006
The paper describes some possible ways how to improve Olympiads in Informatics. Tasks in Olympiads are small models of programming tasks in software industry and in the limited amo...