The following pages link to Cedric Chauve (Q188706):
Displaying 39 items.
- Efficient chaining of seeds in ordered trees (Q450556) (← links)
- A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix (Q456131) (← links)
- A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes (Q627175) (← links)
- On maximal instances for the original syntenic distance (Q703532) (← links)
- A more efficient algorithm for perfect sorting by reversals (Q963340) (← links)
- A geometric version of the Robinson-Schensted correspondence for skew oscillating tableaux (Q1348141) (← links)
- The gene family-free median of three (Q1708419) (← links)
- Hardness results on the gapped consecutive-ones property problem (Q1759853) (← links)
- Tree pattern matching with a more general notion of occurrence of the pattern. (Q1853013) (← links)
- Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti (Q1885017) (← links)
- A mixed integer linear programming algorithm for plasmid binning (Q2163971) (← links)
- Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models (Q2303740) (← links)
- Combinatorial operators for Kronecker powers of representations of \(\mathfrak S_n\). (Q2654568) (← links)
- A generalization of the results of Kreweras on the enumeration polynomial of inversions in arborescences (Q2757953) (← links)
- Counting, Generating and Sampling Tree Alignments (Q2823014) (← links)
- On the gapped consecutive-ones property (Q2851450) (← links)
- Hypergraph Covering Problems Motivated by Genome Assembly Questions (Q2870051) (← links)
- Average-case analysis of perfect sorting by reversals (Q2890993) (← links)
- Efficient Chaining of Seeds in Ordered Trees (Q3000514) (← links)
- Tractability Results for the Consecutive-Ones Property with Multiplicity (Q3011846) (← links)
- An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Duplication Model (Q3162500) (← links)
- Computing Common Intervals of <i>K</i> Permutations, with Applications to Modular Decomposition of Graphs (Q3394985) (← links)
- Genomes Containing Duplicates Are Hard to Compare (Q3545133) (← links)
- Breakpoint Distance and PQ-Trees (Q3575241) (← links)
- Average-Case Analysis of Perfect Sorting by Reversals (Q3637122) (← links)
- Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction (Q3638844) (← links)
- (Q4483920) (← links)
- (Q4502530) (← links)
- (Q4524572) (← links)
- Counting, Generating, Analyzing and Sampling Tree Alignments (Q4683230) (← links)
- The Potential of Family-Free Genome Comparison (Q4992763) (← links)
- PathOGiST: A Novel Method for Clustering Pathogen Isolates by Combining Multiple Genotyping Signals (Q5041139) (← links)
- PRINCE: Accurate approximation of the copy number of tandem repeats (Q5090360) (← links)
- An Exact Enumeration of Distance-Hereditary Graphs (Q5195033) (← links)
- Algorithms – ESA 2005 (Q5475886) (← links)
- Comparative Genomics (Q5492789) (← links)
- Enumerating alternating trees (Q5937130) (← links)
- A graph-theoretic barcode ordering model for linked-reads (Q6487642) (← links)
- A Vector Representation for Phylogenetic Trees (Q6728386) (← links)
