Demo Data from VLDB 2026 / reviewers in the wild / expert
Joël Alexandre
dblp:57/566
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 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.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › sequence analysis
repeat detection |
0.0 | 1 | 2003 | FORRepeats: detects repeats on entire chromosomes and between genomes · Bioinform. 2003 |
Bioinformatics and computational biology
sequence analysis |
0.0 | 1 | 2003 | FORRepeats: detects repeats on entire chromosomes and between genomes · Bioinform. 2003 |
Methods — techniques the papers use, named apart from their topics
heuristic string matching · 0.0factor oracle · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | Extracting Approximate Patterns
Johann Pelfrêne, Saïd Abdeddaïm, Joël Alexandre |
CPM | 3 |
| 2003 | FORRepeats: detects repeats on entire chromosomes and between genomesabstractMOTIVATION: As more and more whole genomes are available, there is a need for new methods to compare large sequences and transfer biological knowledge from annotated genomes to related new ones. BLAST is not suitable to compare multimegabase DNA sequences. MegaBLAST is designed to compare closely related large sequences. Some tools to detect repeats in large sequences have already been developed such as MUMmer or REPuter. They also have time or space restrictions. Moreover, in terms of applications, REPuter only computes repeats and MUMmer works better with related genomes. RESULTS: We present a heuristic method, named FORRepeats, which is based on a novel data structure called factor oracle. In the first step it detects exact repeats in large sequences. Then, in the second step, it computes approximate repeats and performs pairwise comparison. We compared its computational characteristics with BLAST and REPuter. Results demonstrate that it is fast and space economical. We show FORRepeats ability to perform intra-genomic comparison and to detect repeated DNA sequences in the complete genome of the model plant Arabidopsis thaliana. Arnaud Lefebvre, Thierry Lecroq, Hélène Dauchel, Joël Alexandre |
Bioinform. | 4 |