Aïda Ouangraoua

Orcid: 0000-0002-2040-4948

Affiliations:
  • University of Sherbrooke, Canada
  • INRIA, France (former)


According to our database1, Aïda Ouangraoua authored at least 45 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Median and Small Parsimony Problems on RNA trees.
CoRR, 2024

2023
GAIA: G-quadruplexes in alive creature database.
Nucleic Acids Res., January, 2023

Inferring Clusters of Orthologous and Paralogous Transcripts.
Proceedings of the Comparative Genomics - 20th International Conference, 2023

2021
OpenProt 2021: deeper functional annotation of the coding potential of eukaryotic genomes.
Nucleic Acids Res., 2021

DoubleRecViz: a web-based tool for visualizing transcript-gene-species tree reconciliation.
Bioinform., 2021

Gene tree and species tree reconciliation with endosymbiotic gene transfer.
Bioinform., 2021

2019
The SCJ Small Parsimony Problem for Weighted Gene Adjacencies.
IEEE ACM Trans. Comput. Biol. Bioinform., 2019

OpenProt: a more comprehensive guide to explore eukaryotic coding potential and proteomes.
Nucleic Acids Res., 2019

SimSpliceEvol: alternative splicing-aware simulation of biological sequence evolution.
BMC Bioinform., 2019

SplicedFamAlign: CDS-to-gene spliced alignment and identification of transcript orthology groups.
BMC Bioinform., 2019

2018
Gene Tree Construction and Correction Using SuperTree and Reconciliation.
IEEE ACM Trans. Comput. Biol. Bioinform., 2018

aliFreeFold: an alignment-free approach to predict secondary structure from homologous RNA sequences.
Bioinform., 2018

2017
Reconstructing protein and gene phylogenies using reconciliation and soft-clustering.
J. Bioinform. Comput. Biol., 2017

Improving spliced alignment for identification of ortholog groups and multiple CDS alignment.
CoRR, 2017

Aligning coding sequences with frameshift extension penalties.
Algorithms Mol. Biol., 2017

A General Framework for Gene Tree Correction Based on Duplication-Loss Reconciliation.
Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017

2016
The SCJ small parsimony problem for weighted gene adjacencies (Extended version).
CoRR, 2016

Reconstructing protein and gene phylogenies by extending the framework of reconciliation.
CoRR, 2016

The SCJ Small Parsimony Problem for Weighted Gene Adjacencies.
Proceedings of the Bioinformatics Research and Applications - 12th International Symposium, 2016

2015
Reconstructing a SuperGeneTree minimizing reconciliation.
BMC Bioinform., December, 2015

Reconstructing the history of a WD40 beta-propeller tandem repeat using a phylogenetically informed algorithm.
PeerJ Comput. Sci., 2015

Alignment of protein-coding sequences with frameshift extension penalties.
CoRR, 2015

2014
On the Identification of Conflicting Contiguities in Ancestral Genome Reconstruction.
J. Comput. Biol., 2014

2012
Faster and Simpler Minimal Conflicting Set Identification
CoRR, 2012

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

Tandem Halving Problems by DCJ.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

On the Comparison of Sets of Alternative Transcripts.
Proceedings of the Bioinformatics Research and Applications - 8th International Symposium, 2012

Faster and Simpler Minimal Conflicting Set Identification - (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Single Tandem Halving by Block Interchange.
Proceedings of the Biomedical Engineering Systems and Technologies, 2012

Genome Halving by Block Interchange.
Proceedings of the BIOINFORMATICS 2012 - Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms, Vilamoura, Algarve, Portugal, 1, 2012

2011
A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes.
Theor. Comput. Sci., 2011

A 2-Approximation for the Minimum Duplication Speciation Problem.
J. Comput. Biol., 2011

Theory and Practice of Ultra-Perfection.
J. Comput. Biol., 2011

Genome dedoubling by DCJ and reversal.
BMC Bioinform., 2011

Reconstructing the architecture of the ancestral amniote genome.
Bioinform., 2011

2010
Combinatorial Structure of Genome Rearrangements Scenarios.
J. Comput. Biol., 2010

Yeast Ancestral Genome Reconstructions: The Possibilities of Computational Methods II.
J. Comput. Biol., 2010

An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Duplication Model.
Proceedings of the Comparative Genomics - International Workshop, 2010

Ultra-Perfect Sorting Scenarios.
Proceedings of the Comparative Genomics - International Workshop, 2010

2009
A constrained edit distance algorithm between semi-ordered trees.
Theor. Comput. Sci., 2009

A new constrained edit distance between quotiented ordered trees.
J. Discrete Algorithms, 2009

A 3-approximation algorithm for computing a parsimonious first speciation in the gene duplication model
CoRR, 2009

Parking Functions, Labeled Trees and DCJ Sorting Scenarios.
Proceedings of the Comparative Genomics, International Workshop, 2009

Prediction of Contiguous Regions in the Amniote Ancestral Genome.
Proceedings of the Bioinformatics Research and Applications, 5th International Symposium, 2009

2007
Local similarity between quotiented ordered trees.
J. Discrete Algorithms, 2007


  Loading...