-
Finding approximate repetitions under Hamming distance
The problem of computing tandem repetitions with $K$ possible mismatches is studied. Two main definitions are considered, and for both of them an $O(nK\log K+S)$... -
Expressive Pattern Matching with Logol. Application to the Modelling of -1 Ri...
The current practice of pattern matching tools and the gap that may be observed with the actual modelling needs of people analysing genome structures clearly... -
Finding Repeats With Fixed Gap
We propose an algorithm for finding in a word all pairs of occurrences of the same subword with a given distance r between them. The obtained complexity is O(n\log r... -
To detect and analyze sequence repeats whatever be their origin
International audience -
Left Pattern Matching Predictor is Optimal Over Bernoulli Source Models
We show that the Left Pattern Matching predictor is perfect and optimal over Bernoulli source models. We prove the proposition by induction on the size of the text. We... -
A language and an Integrated Environment for Program Transformations
We present the TrfL language, a rule-based language designed for program transformations. For the end-user, TrfL is intended to support both direct manipulation in an... -
Mapping Software Architectures to Efficient Implementations via Partial Evalu...
Flexibility is recognized as a key feature in structuring software, and many architectures have been designed to that effect. However, they often come with performance... -
An Algorithm for Estimating all Matches Between Two Strings
We give a randomized algorithm for estimating the score vector of matches between a text string of length~$N$ and a pattern string of length~$M$; this is the vector... -
Composition Context Matching for Web Service Recommendation
International audience -
Optimal routing in the De Bruijn networks
In this paper, we consider the problem of optimal routing in an interconnection network, called the De Bruijn network, where the sites are linked in the form of a De... -
Large deviation properties for patterns
Presentation at LSD&LAW 2012. To appear in JDA. -
Tying up the loose ends in fully LZW-compressed pattern matching
International audience -
A type system for embedded rewriting programming
In software engineering, type systems are often considered in order to prevent the occurrence of meaningless terms in regard to a type specification. When extending a... -
Constraint-Based Type Inference for Guarded Algebraic Data Types
Guarded algebraic data types subsume the concepts known in the literature as indexed types, guarded recursive datatype constructors, and first-class phantom types, and... -
Compiling Pattern Matching in Join-Patterns
We propose an extension of the join-calculus with pattern matching on algebraic data types. Our initial motivation is twofold: to provide an intuitive semantics of the... -
A new optimization method of the geometric distance in an automatic recogniti...
International audience -
A Branch and Bound Approach to Correspondence and Grouping Problems
International audience -
Cross-Document Pattern Matching
International audience -
Graph based System Purpose - Built for Automatic Retrieval and Extraction of ...
International audience
