523 search results - page 43 / 105 » Decidability of string graphs |
130
Voted
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
118
Voted
IWINAC
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we consider networks of evolutionary processors with splicing rules and permitting context (NEPPS) as language generating and computational devices. Such a network c...
135
click to vote
CP
2007
Springer
15 years 9 months ago
2007
Springer
A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this...
109
Voted
WABI
2007
Springer
15 years 9 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
132
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...