Sciweavers

1153 search results - page 22 / 231
» Reversing graph transformations
Sort
View
COCOON
2005
Springer
15 years 3 months ago
Perfect Sorting by Reversals
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
Marie-France Sagot, Eric Tannier
COMBINATORICS
2007
112views more  COMBINATORICS 2007»
14 years 9 months ago
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
Petr Kolman, Tomasz Walen
BIRTHDAY
2010
Springer
14 years 9 months ago
The Edge of Graph Transformation - Graphs for Behavioural Specification
The title of this paper, besides being a pun, can be taken to mean either the frontier of research in graph transformation, or the advantage of using graph transformation. To focus...
Arend Rensink
88
Voted
ACL
1990
14 years 10 months ago
Transforming Syntactic Graphs into Semantic Graphs
In this paper, we present a computational method for transforming a syntactic graph, which represents all syntactic interpretations of a sentence, into a semantic graph which filt...
Hae-Chang Rim, Jungyun Seo, Robert F. Simmons
CAV
2008
Springer
143views Hardware» more  CAV 2008»
14 years 11 months ago
Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem v...
Salil Joshi, Barbara König