The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...
We introduce a new incremental search method called Migemo for languages with many character faces. Migemo performs the incremental search by dynamically expanding the input patte...
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
Network traces are essential for a wide range of network applications, including traffic analysis, network measurement, performance monitoring, and security analysis. Existing cap...
Chia-Wei Chang, Alexandre Gerber, Bill Lin, Subhab...