The following pages link to Anthony Labarre (Q281901):
Displaying 21 items.
- Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution (Q281902) (← links)
- Polynomial-time sortable stacks of burnt pancakes (Q627167) (← links)
- Solving the tree containment problem in linear time for nearly stable phylogenetic networks (Q1647836) (← links)
- Sorting with forbidden intermediates (Q2181215) (← links)
- Central limit theorem for the prefix exchange distance under Ewens sampling formula (Q2214057) (← links)
- The distribution of cycles in breakpoint graphs of signed permutations (Q2446324) (← links)
- Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time (Q2798232) (← links)
- Locating a Tree in a Phylogenetic Network in Quadratic Time (Q2814579) (← links)
- Decomposing Cubic Graphs into Connected Subgraphs of Size Three (Q2817881) (← links)
- Lower Bounding Edit Distances between Permutations (Q2870513) (← links)
- (Q3393448) (← links)
- Edit Distances and Factorisations of Even Permutations (Q3541123) (← links)
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with<i>IDP3</i> (Q4593015) (← links)
- (Q5387506) (← links)
- (Q5398039) (← links)
- The clever shopper problem (Q5915572) (← links)
- The clever shopper problem (Q5919456) (← links)
- Sorting by prefix block-interchanges (Q6038693) (← links)
- Decomposing subcubic graphs into claws, paths or triangles (Q6056758) (← links)
- (Q6065464) (← links)
- Sorting genomes by prefix double-cut-and-joins (Q6652451) (← links)
