Finding founder sequences from a set of recombinants

DOI10.1007/3-540-45784-4_21MaRDI QIDQ4410142zbMATH OpenFDO

Authors Esko Ukkonen

Publication date 2 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2452/24520277.htm

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20)

Recommendations

• Minimum mosaic inference of a set of recombinants
• Large neighbourhood search algorithms for the founder sequence reconstruction problem
• Methods for inferring block-wise ancestral history from haploid sequences
• Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
• Reconstructing a history of recombinations from a set of sequences

Cited in

(11)

• Large neighbourhood search algorithms for the founder sequence reconstruction problem
• Minimum mosaic inference of a set of recombinants
• Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
• Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations
• Methods for inferring block-wise ancestral history from haploid sequences
• Minimum segmentation for pan-genomic founder reconstruction in linear time
• Computational graph pangenomics: a tutorial on data structures and their applications
• Elastic founder graphs improved and enhanced
• Linear time construction of indexable founder block graphs
• Linear time maximum segmentation problems in column stream model
• Constructing founder sets under allelic and non-allelic homologous recombination

This page was built for publication: Finding founder sequences from a set of recombinants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4410142)