1423 search results - page 39 / 285 » Languages of Nested Trees |
162
click to vote
IJCAI
2007
15 years 8 months ago
2007
ESSENCE is a new formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that use a mixture of natural language and discrete ...
186
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
166
click to vote
CMSB
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. CBS is a Calculus of Biochemical Systems intended to allow the modelling of metabolic, signalling and regulatory networks in a natural and modular manner. In this paper w...
194
click to vote
ICDT
2012
ACM
13 years 9 months ago
2012
ACM
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
181
click to vote
CPM
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...