Sciweavers

1513 search results - page 181 / 303
» Cryptographic Pattern Matching
Sort
View
APAL
2008
112views more  APAL 2008»
13 years 10 months ago
A domain model characterising strong normalisation
Building on previous work by Coquand and Spiwack [8] we construct a strict domaintheoretic model for the untyped -calculus with pattern matching and term rewriting which has the p...
Ulrich Berger
IJFCS
2008
110views more  IJFCS 2008»
13 years 10 months ago
Indexing Gapped-Factors Using a Tree
We present a data structure to index a specific kind of factors, that is of substrings, called gapped-factors. A gapped-factor is a factor containing a gap that is ignored during ...
Pierre Peterlongo, Julien Allali, Marie-France Sag...
ENTCS
2007
96views more  ENTCS 2007»
13 years 10 months ago
Synchrony vs Asynchrony in Communication Primitives
We study, from the expressiveness point of view, the impact of synchrony in the communication primitives that arise when combining together some common and useful programming feat...
Daniele Gorla
SIAMCOMP
2008
121views more  SIAMCOMP 2008»
13 years 10 months ago
Closest Substring Problems with Small Distances
We study two pattern matching problems that are motivated by applications in computational biology. In the Closest Substring problem k strings s1, . . ., sk are given, and the tas...
Dániel Marx
PR
2002
112views more  PR 2002»
13 years 10 months ago
Finding approximate palindromes in strings
We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de ni...
Alexandre H. L. Porto, Valmir C. Barbosa