8810 search results - page 460 / 1762 » Openness |
173
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The hairpin completion is a natural operation on formal languages which has been inspired by biochemistry and DNA-computing. In this paper we solve two problems which were posed f...
148
click to vote
EJC
2010
15 years 6 months ago
2010
The paper contains a construction of a universal countable graph, different from the Rado graph, such that for any of its vertices both the neighbourhood and the non-neighbourhood ...
221
click to vote
ALMOB
2006
15 years 6 months ago
2006
This editorial announces Algorithms for Molecular Biology, a new online open access journal published by BioMed Central. By launching the first open access journal on algorithmic ...
161
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Detecting new coding sequences (CDSs) in viral genomes can be difficult for several reasons. The typically compact genomes often contain a number of overlapping coding...
164
click to vote
DAM
2006
15 years 6 months ago
2006
In the precoloring extension problem we are given a graph with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a ...