Alain Denise

Orcid: 0000-0003-4484-4996

Affiliations:
  • University of Paris-Sud, Laboratory for Computer Science (LRI), France


According to our database1, Alain Denise authored at least 42 papers between 1995 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings.
Int. J. Approx. Reason., November, 2023

2021
Finding recurrent RNA structural networks with fast maximal common subgraphs of edge-colored graphs.
PLoS Comput. Biol., 2021

Efficient, robust and effective rank aggregation for massive biological datasets.
Future Gener. Comput. Syst., 2021

A Graph-Based Similarity Approach to Classify Recurrent Complex Motifs from Their Context in RNA Structures.
Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

2019
CoMetGeNe: mining conserved neighborhood patterns in metabolic and genomic contexts.
BMC Bioinform., December, 2019

Reliability-Aware and Graph-Based Approach for Rank Aggregation of Biological Data.
Proceedings of the 15th International Conference on eScience, 2019

2017
GARN2: coarse-grained prediction of 3D structure of large RNA molecules by regret minimization.
Bioinform., 2017

2015
Rank aggregation with ties: Experiments and Analysis.
Proc. VLDB Endow., 2015

2014
Optimisation Problems for Pairwise RNA Sequence and Structure Comparison: A Brief Survey.
Trans. Comput. Collect. Intell., 2014

ConQuR-Bio: Consensus Ranking with Query Reformulation for Biological Data.
Proceedings of the Data Integration in the Life Sciences - 10th International Conference, 2014

2013
A new dichotomic algorithm for the uniform random generation of words in regular languages.
Theor. Comput. Sci., 2013

An Algorithmic Game-Theory Approach for Coarse-Grain Prediction of RNA 3D Structure.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013

Flexible RNA design under structure and sequence constraints using formal languages.
Proceedings of the ACM Conference on Bioinformatics, 2013

2012
Coverage-biased random exploration of large models and application to testing.
Int. J. Softw. Tools Technol. Transf., 2012

Tree decomposition and parameterized algorithms for RNA structure-sequence alignment including tertiary interactions and pseudoknots.
CoRR, 2012

Automated prediction of three-way junction topological families in RNA secondary structures.
Comput. Biol. Chem., 2012

BRASERO: A Resource for Benchmarking RNA Secondary Structure Comparison Algorithms.
Adv. Bioinformatics, 2012

Tree Decomposition and Parameterized Algorithms for RNA Structure-Sequence Alignment Including Tertiary Interactions and Pseudoknots - (Extended Abstract).
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

2011
Counting RNA Pseudoknotted Structures.
J. Comput. Biol., 2011

Using Medians to Generate Consensus Rankings for Biological Data.
Proceedings of the Scientific and Statistical Database Management, 2011

Uniform Monte-Carlo Model Checking.
Proceedings of the Fundamental Approaches to Software Engineering, 2011

2010
Average complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of a RNA secondary structure alignment algorithm.
Theor. Comput. Sci., 2010

Controlled non-uniform random generation of decomposable structures.
Theor. Comput. Sci., 2010

Alignments of RNA Structures.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010

2009
VARNA: Interactive drawing and editing of the RNA secondary structure.
Bioinform., 2009

2008
Shuffling biological sequences with motif constraints.
J. Discrete Algorithms, 2008

Coverage-biased Random Exploration of Models.
Proceedings of the Fourth Workshop on Model Based Testing, 2008

2006
GenRGenS: software for generating random genomic sequences and structures.
Bioinform., 2006

Uniform random sampling of traces in very large models.
Proceedings of the 1st International Workshop on Random Testing, 2006

2005
A Pairwise Alignment Algorithm Which Favors Clusters of Blocks.
J. Comput. Biol., 2005

2004
Rare Events and Conditional Events on Random Strings.
Discret. Math. Theor. Comput. Sci., 2004

A Generic Method for Statistical Testing.
Proceedings of the 15th International Symposium on Software Reliability Engineering (ISSRE 2004), 2004

2003
The permutation-path coloring problem on trees.
Theor. Comput. Sci., 2003

Towards a computational model for -1 eukaryotic frameshifting sites.
Bioinform., 2003

2002
Generating functions for generating trees.
Discret. Math., 2002

2001
Assessing the Statistical Significance of Overrepresented Oligonucleotides.
Proceedings of the Algorithms in Bioinformatics, First International Workshop, 2001

A New Way of Automating Statistical Testing Methods.
Proceedings of the 16th IEEE International Conference on Automated Software Engineering (ASE 2001), 2001

2000
On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999
Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic.
Theor. Comput. Sci., 1999

1996
Génération aléatoire uniforme de mots de langages rationnels.
Theor. Comput. Sci., 1996

Génération aléatoire et uniforme de mots.
Discret. Math., 1996

1995
Two combinatorial statistics on Dyck paths.
Discret. Math., 1995


  Loading...