The following pages link to David Sankoff (Q242879):
Displaying 50 items.
- The inference of hierarchical schemes for multinomial data (Q582729) (← links)
- RNA secondary structures and their prediction (Q799529) (← links)
- The computational complexity of inferring rooted phylogenies by parsimony (Q1086183) (← links)
- A continuous analogue for RNA folding (Q1111965) (← links)
- Efficient optimal decomposition of a sequence into disjoint regions, each matched to some template in an inventory (Q1205301) (← links)
- A tree \(\cdot\) a window \(\cdot\) a hill; generalization of nearest- neighbor interchange in phylogenetic optimization (Q1344859) (← links)
- Asymptotic medians of random permutations sampled from reversal random walks (Q1676301) (← links)
- A randomized FPT approximation algorithm for maximum alternating-cycle decomposition with applications (Q1790950) (← links)
- An efficient algorithm for supertrees (Q1901397) (← links)
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement (Q1902472) (← links)
- A remarkable nonlinear invariant for evolution with heterogeneous rates (Q1914213) (← links)
- Syntenic dimensions of genomic evolution (Q2163939) (← links)
- Peripheral structures in unlabelled trees and the accumulation of subgenomes in the evolution of polyploids (Q2243122) (← links)
- Genome rearrangements with partially ordered chromosomes (Q2498979) (← links)
- Context-free grammars and nonnegative matrices (Q2554241) (← links)
- Shortcuts, diversions, and maximal chains in partially ordered sets (Q2559393) (← links)
- (Q2741296) (← links)
- (Q2918486) (← links)
- (Q3024799) (← links)
- (Q3048079) (← links)
- OMG! Orthologs in Multiple Genomes – Competing Graph-Theoretical Formulations (Q3091376) (← links)
- Rearrangement of Noisy Genomes (Q3545134) (← links)
- Simultaneous Solution of the RNA Folding, Alignment and Protosequence Problems (Q3705254) (← links)
- Longest common subsequences of two random sequences (Q4072574) (← links)
- Minimal Mutation Trees of Sequences (Q4074916) (← links)
- Locating the vertices of a steiner tree in an arbitrary metric space (Q4077102) (← links)
- Exact distribution of product of generalized <i>F</i>‐variates (Q4151583) (← links)
- (Q4174082) (← links)
- (Q4277745) (← links)
- (Q4364593) (← links)
- (Q4379335) (← links)
- (Q4509227) (← links)
- The Reconstruction of Doubled Genomes (Q4706230) (← links)
- STEINER POINTS IN THE SPACE OF GENOME REARRANGEMENTS (Q4888364) (← links)
- (Q4955463) (← links)
- Gaps and Runs in Syntenic Alignments (Q5041125) (← links)
- The empirical discovery of phylogenetic invariants (Q5286945) (← links)
- (Q5457073) (← links)
- (Q5457107) (← links)
- (Q5457142) (← links)
- (Q5471627) (← links)
- Comparative Genomics (Q5492795) (← links)
- Comparative Genomics (Q5492800) (← links)
- Comparative Genomics (Q5492801) (← links)
- An Inequality for Probabilities (Q5534673) (← links)
- A Packing Problem for Measurable Sets (Q5600538) (← links)
- Duration of detectible synchrony in a binary branching process (Q5621830) (← links)
- Branching processes with terminal types: application to context-free grammars (Q5627485) (← links)
- Dictionary structure and probability measures (Q5627626) (← links)
- Matching Sequences under Deletion/Insertion Constraints (Q5644001) (← links)
