The following pages link to Algorithms and Computation (Q5897870):
Displaying 7 items.
- The complexity of genome rearrangement combinatorics under the infinite sites model (Q827869) (← links)
- The complexity of assigning genotypes to people in a pedigree consistently (Q2370452) (← links)
- Complexity and approximation of the minimum recombinant haplotype configuration problem (Q2371806) (← links)
- An efficient algorithm for haplotype inference on pedigrees with a small number of recombinants (Q2428680) (← links)
- Optimal recombination algorithms for generalized chains (Q3514848) (← links)
- On the Approximability of Some Haplotyping Problems (Q3638438) (← links)
- Theoretical Computer Science (Q5897359) (← links)