Demo Data from EDBT 2026 / reviewers in the wild / expert
Max Dauchet
dblp:56/2230
· DBLP profile ↗
34ranked-venue papers
13as first author
0since 2021 · last 2003
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 30 · 13 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2Applied, interdisciplinary, general and emerging computing · 2Artificial intelligence and machine learning · 1Software engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
10 papers |
Logic in computer science · 36% Automata and formal languages · 28% Mathematical optimization · 23% | |
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 100% |
Topics — the 18 heaviest of 19, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › RNA biology › RNA analysis › RNA bioinformatics
RNA structure prediction |
0.0 | 1 | 2003 | Finding the common structure shared by two homologous RNAs · Bioinform. 2003 |
Mathematical optimization
scheduling |
0.0 | 1 | 1999 | Maximization of the Average Quality of Anytime Contract Algorithms over a Time Interval · IJCAI 1999 |
Logic in computer science
term rewriting |
0.0 | 3 | 1990 | Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems · Inf. Comput. 1990 The Theory of Ground Rewrite Systems is Decidable · LICS 1990 Decidability of the Confluence of Ground Term Rewriting Systems · LICS 1987 |
Bioinformatics and computational biology › genomics
genome analysis |
0.0 | 1 | 1997 | Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences · Comput. Appl. Biosci. 1997 |
Bioinformatics and computational biology › sequence analysis › repeat detection
tandem repeat detection |
0.0 | 1 | 1997 | Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences · Comput. Appl. Biosci. 1997 |
Automata and formal languages › regular languages
kleene theorem |
0.0 | 1 | 1995 | A Kleene Theorem for a Class of Planar Acyclic Graphs · Inf. Comput. 1995 |
Automated reasoning and model checking
constraint solving |
0.0 | 1 | 1994 | Pumping, Cleaning and Symbolic Constraints Solving · ICALP 1994 |
Automata and formal languages › regular languages
pumping lemma |
0.0 | 1 | 1994 | Pumping, Cleaning and Symbolic Constraints Solving · ICALP 1994 |
Logic in computer science › term rewriting
confluence |
0.0 | 2 | 1990 | Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems · Inf. Comput. 1990 Decidability of the Confluence of Ground Term Rewriting Systems · LICS 1987 |
Logic in computer science › term rewriting
ground convergent rewrite system |
0.0 | 2 | 1990 | The Theory of Ground Rewrite Systems is Decidable · LICS 1990 Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems · Inf. Comput. 1990 |
Automata and formal languages
tree automata |
0.0 | 2 | 1990 | The Theory of Ground Rewrite Systems is Decidable · LICS 1990 Sul l'inversion des morphisms d'arbres · ICALP 1978 |
Mathematical optimization › scheduling
contract algorithms |
0.0 | 1 | 1999 | Maximization of the Average Quality of Anytime Contract Algorithms over a Time Interval · IJCAI 1999 |
Logic in computer science
rewriting systems |
0.0 | 1 | 1990 | Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems · Inf. Comput. 1990 |
Graph algorithms and graph theory
planar graphs |
0.0 | 1 | 1995 | A Kleene Theorem for a Class of Planar Acyclic Graphs · Inf. Comput. 1995 |
Logic in computer science
domain theory |
0.0 | 1 | 1982 | Approximations of Infinitary Objects · ICALP 1982 |
Automata and formal languages
algebraic language theory |
0.0 | 1 | 1978 | Forêts Algébriques et Homomorphismes Inverses · Inf. Control. 1978 |
Automata and formal languages
tree languages |
0.0 | 1 | 1978 | Forêts Algébriques et Homomorphismes Inverses · Inf. Control. 1978 |
Automata and formal languages
tree transducers |
0.0 | 1 | 1976 | Bi-transductions de forêts · ICALP 1976 |
Methods — techniques the papers use, named apart from their topics
stem energy model · 0.0covariation analysis · 0.0compression algorithms · 0.0tree automata · 0.0term rewriting · 0.0domain theory · 0.0inverse homomorphism · 0.0algebraic forests · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | Finding the common structure shared by two homologous RNAsabstractMOTIVATION: CARNAC is a new method for pairwise folding of RNA sequences. The program takes into account local similarity, stem energy, and covariations to produce the common folding. It can handle all RNA types, and has also been adapted to align a new homologous sequence along a reference structured sequence. RESULTS: Using different data sets, we show that CARNAC provides a good partial prediction for a wide range of sequences (16S ssu rRNA, RNase P RNA, viruses) with only two sequences. In presence of a whole family of sequences, we also show that CARNAC can be used to detect whether the sequences actually share the same structure. AVAILABILITY: CARNAC is available at the URLhttp://www.lifl.fr/~perrique/rna/. Olivier Perriquet, Hélène Touzet, Max Dauchet |
Bioinform. | 3 |
| 2002 | Reduction de la non-linearite des morphismes d'arbres Recognizable tree-languages and non-linear morphisms
Max Dauchet, Sophie Tison, Marc Tommasi |
Theor. Comput. Sci. | 1 |
| 2000 | Trees in Algebra and Programming (Editorial)
Max Dauchet |
Theor. Comput. Sci. | 1 |
| 1999 | Maximization of the Average Quality of Anytime Contract Algorithms over a Time Interval
Arnaud Delhay, Max Dauchet, Patrick Taillibert, Philippe Vanheeghe |
IJCAI | 2 |
| 1998 | Deterministic Rational Transducers and Random Sequences
Sylvain Porrot, Max Dauchet, Bruno Durand 0001, Nikolai K. Vereshchagin |
FoSSaCS | 2 |
| 1997 | Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequencesabstractMOTIVATION: Compression algorithms can be used to analyse genetic sequences. A compression algorithm tests a given property on the sequence and uses it to encode the sequence: if the property is true, it reveals some structure of the sequence which can be described briefly, this yields a description of the sequence which is shorter than the sequence of nucleotides given in extenso. The more a sequence is compressed by the algorithm, the more significant is the property for that sequence. RESULTS: We present a compression algorithm that tests the presence of a particular type of dosDNA (defined ordered sequence-DNA): approximate tandem repeats of small motifs (i.e. of lengths < 4). This algorithm has been experimented with on four yeast chromosomes. The presence of approximate tandem repeats seems to be a uniform structural property of yeast chromosomes. Eric Rivals, Olivier Delgrange, Jean-Paul Delahaye, Max Dauchet, Marie-Odile Delorme, Alain Hénaut, Emmanuelle Ollivier |
Comput. Appl. Biosci. | 4 |
| 1996 | A Guaranteed Compression Scheme for Repetitive DNA SequencesabstractWe present a text compression scheme dedicated to DNA sequences. The exponential growing of the number of sequences creates a real need for analyzing tools. A specific need emerges for methods that perform sequences classification upon various criteria, one of which is the sequence repetitiveness. A good lossless compression scheme is able to distinguish between "random" and "significative" repeats. Theoretical bases for this statement are found in Kolmogorov complexity theory. Eric Rivals, Jean-Paul Delahaye, Max Dauchet, Olivier Delgrange |
Data Compression Conference | 3 |
| 1995 | A Kleene Theorem for a Class of Planar Acyclic Graphs
Francis Bossut, Max Dauchet, Bruno Warin |
Inf. Comput. | 2 |
| 1995 | Automata for Reduction Properties Solving
Max Dauchet, Anne-Cécile Caron, Jean-Luc Coquidé |
J. Symb. Comput. | 1 |
| 1994 | Pumping, Cleaning and Symbolic Constraints Solving
Anne-Cécile Caron, Hubert Comon-Lundh, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard |
ICALP | 4 |
| 1994 | Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems
Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi |
Theor. Comput. Sci. | 2 |
| 1993 | Encompassment Properties and Automata with Constraints
Anne-Cécile Caron, Jean-Luc Coquidé, Max Dauchet |
RTA | 3 |
| 1993 | Weighted Systems of Equations
Philippe Devienne, Patrick Lebègue, Max Dauchet |
Theor. Comput. Sci. | 3 |
| 1992 | Simulation of Turing Machines by a Regular Rewrite Rule
Max Dauchet |
Theor. Comput. Sci. | 1 |
| 1991 | Bottom-Up Tree Pushdown Automata and Rewrite Systems
Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi |
RTA | 2 |
| 1990 | The Theory of Ground Rewrite Systems is DecidableabstractUsing tree automata techniques, it is proven that the theory of ground rewrite systems is decidable. Novel decision procedures are presented for most classic properties of ground rewrite systems. An example is presented to illustrate how these results could be used for specification and debugging.> Max Dauchet, Sophie Tison |
LICS | 1 |
| 1990 | Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems
Max Dauchet, Thierry Heuillard, Pierre Lescanne, Sophie Tison |
Inf. Comput. | 1 |
| 1989 | About Connections Between Syntactical and Computational Complexity
Jean-Luc Coquidé, Max Dauchet, Sophie Tison |
FCT | 2 |
| 1989 | Simulation of Turning Machines by a Left-Linear Rewrite Rule
Max Dauchet |
RTA | 1 |
| 1989 | Compilation of Ground Term Rewriting Systems and Applications
Max Dauchet, Aline Deruyver |
RTA | 1 |
| 1988 | Automata and Rational Expressions on Planar Graphs
Francis Bossut, Max Dauchet, Bruno Warin |
MFCS | 2 |
| 1988 | Termination of Rewriting is Undecidable in the One-Rule Case
Max Dauchet |
MFCS | 1 |
| 1987 | Decidability of the Confluence of Ground Term Rewriting Systems
Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne |
LICS | 1 |
| 1987 | A Gap Between Linear and Non Linear Term-Rewriting Systems (1)
Max Dauchet, Francesco De Comité |
RTA | 1 |
| 1985 | Decidability of confluence for ground term rewriting systems
Max Dauchet, Sophie Tison |
FCT | 1 |
| 1983 | Metrical an Ordered Properties of Powerdomains
Sophie Tison, Max Dauchet, Gérard Comyn |
FCT | 2 |
| 1982 | Approximations of Infinitary Objects
Gérard Comyn, Max Dauchet |
ICALP | 2 |
| 1982 | Morphismes et Bimorphismes d'Arbres
André Arnold, Max Dauchet |
Theor. Comput. Sci. | 2 |
| 1979 | Transformations de noyaux reconnaissables
Max Dauchet, Jocelyne Mongy |
FCT | 1 |
| 1978 | Sul l'inversion des morphisms d'arbres
André Arnold, Max Dauchet |
ICALP | 2 |
| 1978 | Forêts Algébriques et Homomorphismes Inverses
André Arnold, Max Dauchet |
Inf. Control. | 2 |
| 1978 | Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables
André Arnold, Max Dauchet |
Math. Syst. Theory | 2 |
| 1976 | Bi-transductions de forêts
André Arnold, Max Dauchet |
ICALP | 2 |
| 1976 | Un Théorème de Duplication pour les Forêts Algébriques
André Arnold, Max Dauchet |
J. Comput. Syst. Sci. | 2 |