Manuel Lafond

Algorithms Mol. Biol., December, 2024

Median and Small Parsimony Problems on RNA trees.

[BibT_eX]

[DOI]

CoRR, 2024

Galled Perfect Transfer Networks.

[BibT_eX]

[DOI]

Alitzel López Sánchez

Proceedings of the Comparative Genomics - 21st International Conference, 2024

2023

Relative timing information and orthology in evolutionary scenarios.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., December, 2023

Recognizing <i>k</i>-Leaf Powers in Polynomial Time, for Constant <i>k</i>.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, October, 2023

On the Tractability of Covering a Graph with 2-Clubs.

[BibT_eX]

[DOI]

Algorithmica, April, 2023

Defining Phylogenetic Network Distances Using Cherry Operations.

[BibT_eX]

[DOI]

Kaari Landry

Aivee Teodocio

Olivier Tremblay Savard

IEEE ACM Trans. Comput. Biol. Bioinform., 2023

A lightweight semi-centralized strategy for the massive parallelization of branching algorithms.

[BibT_eX]

[DOI]

Andres Pastrana-Cruz

Parallel Comput., 2023

An FTP Algorithm for Temporal Graph Untangling.

[BibT_eX]

[DOI]

CoRR, 2023

The Two-Squirrel Problem and Its Relatives.

[BibT_eX]

[DOI]

CoRR, 2023

Finding Agreement Cherry-Reduced Subnetworks in Level-1 Networks.

[BibT_eX]

[DOI]

Kaari Landry

Olivier Tremblay Savard

Proceedings of the Comparative Genomics - 20th International Conference, 2023

Two Strikes Against the Phage Recombination Problem.

[BibT_eX]

[DOI]

Anne Bergeron

Krister M. Swenson

Proceedings of the Comparative Genomics - 20th International Conference, 2023

Classifying the Post-duplication Fate of Paralogous Genes.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics - 20th International Conference, 2023

Parameterized Complexity of Domination Problems Using Restricted Modular Partitions.

[BibT_eX]

[DOI]

Weidong Luo

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Preprocessing complexity for some graph problems parameterized by structural parameters.

[BibT_eX]

[DOI]

Weidong Luo

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

An FPT Algorithm for Temporal Graph Untangling.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

The Longest Subsequence-Repeated Subsequence Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

Graph Algorithms and Graph Theory-Symmetry Special Issue.

[BibT_eX]

[DOI]

Symmetry, 2022

Computing the Tandem Duplication Distance is NP-Hard.

[BibT_eX]

[DOI]

Peng Zou

SIAM J. Discret. Math., 2022

Further results on Hendry's Conjecture.

[BibT_eX]

[DOI]

Ben Seamone

Rezvan Sherkati

Discret. Math. Theor. Comput. Sci., 2022

Recognizing <italic>k</italic>-leaf powers in polynomial time, for constant <italic>k</italic>.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

The Complexity of Finding Common Partitions of Genomes with Predefined Block Sizes.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics - 19th International Conference, 2022

How Brokers Can Optimally Abuse Traders.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

2021

Time-energy tradeoffs for evacuation by two robots in the wireless model.

[BibT_eX]

[DOI]

Jurek Czyzowicz

Konstantinos Georgiou

Theor. Comput. Sci., 2021

Edge clique covers in graphs with independence number two.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Colorful orthology clustering in bounded-degree similarity graphs.

[BibT_eX]

[DOI]

Alitzel López Sánchez

J. Bioinform. Comput. Biol., 2021

Recognizing k-leaf powers in polynomial time, for constant k.

[BibT_eX]

[DOI]

CoRR, 2021

Efficient assembly consensus algorithms for divergent contig sets.

[BibT_eX]

[DOI]

Annie Chateau

Tom Davot

Comput. Biol. Chem., 2021

Gene tree and species tree reconciliation with endosymbiotic gene transfer.

[BibT_eX]

[DOI]

Bioinform., 2021

Permutation-Constrained Common String Partitions with Applications.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2021

Novel Phylogenetic Network Distances Based on Cherry Picking.

[BibT_eX]

[DOI]

Kaari Landry

Aivee Teodocio

Olivier Tremblay Savard

Proceedings of the Algorithms for Computational Biology - 8th International Conference, 2021

2020

Whom to befriend to influence people.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Indirect Identification of Horizontal Gene Transfer.

[BibT_eX]

[DOI]

CoRR, 2020

Comparing copy-number profiles under multi-copy amplifications and deletions.

[BibT_eX]

[DOI]

Garance Cordonnier

CoRR, 2020

A generalized Robinson-Foulds distance for labeled trees.

[BibT_eX]

[DOI]

BMC Genom., 2020

The distance and median problems in the single-cut-or-join model with single-gene duplications.

[BibT_eX]

[DOI]

Aniket C. Mane

Pedro Cipriano Feijão

Cédric Chauve

Algorithms Mol. Biol., 2020

Reconstruction of time-consistent species trees.

[BibT_eX]

[DOI]

Miguel Sautie Castellanos

Marc Hellmuth

Algorithms Mol. Biol., 2020

Evolution through segmental duplications and losses: a Super-Reconciliation approach.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2020

Weak Coverage of a Rectangular Barrier.

[BibT_eX]

[DOI]

Algorithmica, 2020

The Tandem Duplication Distance Is NP-Hard.

[BibT_eX]

[DOI]

Peng Zou

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms.

[BibT_eX]

[DOI]

Peng Zou

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Even Better Fixed-Parameter Algorithms for Bicluster Editing.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

On the Weighted Quartet Consensus problem.

[BibT_eX]

[DOI]

Céline Scornavacca

Theor. Comput. Sci., 2019

The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

The SCJ Small Parsimony Problem for Weighted Gene Adjacencies.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2019

Reconciling multiple genes trees via segmental duplications and losses.

[BibT_eX]

[DOI]

Céline Scornavacca

Algorithms Mol. Biol., 2019

Distributed Pattern Formation in a Ring.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2019

Energy Consumption of Group Search on a Line.

[BibT_eX]

[DOI]

Jurek Czyzowicz

Konstantinos Georgiou

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Gene Tree Construction and Correction Using SuperTree and Reconciliation.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2018

Accurate prediction of orthologs in the presence of divergence after duplication.

[BibT_eX]

[DOI]

Miguel Sautie Castellanos

Mona Meghdari Miardan

David Sankoff

Bioinform., 2018

The Rooted SCJ Median with Single Gene Duplications.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics - 16th International Conference, 2018

Reconstructing the History of Syntenies Through Super-Reconciliation.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics - 16th International Conference, 2018

Satisfying Neighbor Preferences on a Circle.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

The complexity of speedrunning video games.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

Editing Graphs to Satisfy Diversity Requirements.

[BibT_eX]

[DOI]

Huda Chuangpishit

Lata Narayanan

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

Rearrangement moves on rooted phylogenetic networks.

[BibT_eX]

[DOI]

PLoS Comput. Biol., 2017

Reconstructing protein and gene phylogenies using reconciliation and soft-clustering.

[BibT_eX]

[DOI]

Esaie Kuitche

Aïda Ouangraoua

J. Bioinform. Comput. Biol., 2017

On strongly chordal graph that are not leaf powers.

[BibT_eX]

[DOI]

CoRR, 2017

Consistency of orthology and paralogy constraints in the presence of gene transfers.

[BibT_eX]

[DOI]

Mark Jones

Céline Scornavacca

CoRR, 2017

Constructing a Consensus Phylogeny from a Leaf-Removal Distance.

[BibT_eX]

[DOI]

CoRR, 2017

Approximating the correction of weighted and unweighted orthology and paralogy relations.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2017

On Strongly Chordal Graphs That Are Not Leaf Powers.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2017

Optimal Local Buffer Management for Information Gathering with Adversarial Traffic.

[BibT_eX]

[DOI]

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Weak Coverage of a Rectangular Barrier.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

The link between orthology relations and gene trees: a correction perspective.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2016

Correction of Weighted Orthology and Paralogy Relations - Complexity and Algorithmic Results.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

Whom to Befriend to Influence People.

[BibT_eX]

[DOI]

Lata Narayanan

Kangkang Wu

Proceedings of the Structural Information and Communication Complexity, 2016

Efficient Non-Binary Gene Tree Resolution with Weighted Reconciliation Cost.

[BibT_eX]

[DOI]

Emmanuel Noutahi

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015

Reconstructing a SuperGeneTree minimizing reconciliation.

[BibT_eX]

[DOI]

Aïda Ouangraoua

BMC Bioinform., December, 2015

Hamiltonian Chordal Graphs are not Cycle Extendable.

[BibT_eX]

[DOI]

Ben Seamone

SIAM J. Discret. Math., 2015

Orthology Relation and Gene Tree Correction: Complexity Results.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015

2014

Polytomy refinement for the correction of dubious duplications in gene trees.

[BibT_eX]

[DOI]

Bioinform., 2014

2013

Hamiltonian chordal graphs are not cycle extendible.

[BibT_eX]

[DOI]

Ben Seamone

CoRR, 2013

Gene tree correction guided by orthology.

[BibT_eX]

[DOI]

BMC Bioinform., 2013

The Scourge of Internet Personal Data Collection.

[BibT_eX]

[DOI]

Esma Aïmeur

Proceedings of the 2013 International Conference on Availability, Reliability and Security, 2013

Error Detection and Correction of Gene Trees.

[BibT_eX]

[DOI]

Krister M. Swenson

Proceedings of the Models and Algorithms for Genome Evolution, 2013

2012

An Optimal Reconciliation Algorithm for Gene Trees with Polytomies.

[BibT_eX]

[DOI]

Krister M. Swenson

Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

Privacy invasion in business environments.

[BibT_eX]

[DOI]