Reconstructing a history of recombinations from a set of sequences
type: Item
instance of: scholarly article
title: Reconstructing a history of recombinations from a set of sequences
zbMATH Open document ID: 0927.68025
DOI: 10.1016/S0166-218X(98)00074-2
author: Dan Gusfield
author: John D. Kececioglu
published in: Discrete Applied Mathematics
publication date: 1998-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68U99
zbMATH DE Number: 1268163
zbMATH Keywords: computational biology
zbMATH Keywords: recombination
MaRDI profile type: Publication
cites work: Q3690245
cites work: Minimal Representation of Directed Hypergraphs
cites work: Dynamic maintenance of directed hypergraphs
cites work: Genome Rearrangements and Sorting by Reversals
cites work: Q4886097
cites work: Efficient probabilistically checkable proofs and applications to approximations
cites work: A robust model for finding optimal evolutionary tree
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Speeding up dynamic programming with applications to molecular biology
cites work: Q4198056
cites work: Efficient algorithms for inferring evolutionary trees
cites work: Q4234063
cites work: Q4252743
cites work: Reconstructing evolution of sequences subject to recombination using parsimony
cites work: A linear space algorithm for computing maximal common subsequences
cites work: Properties of a neutral allele model with intragenic recombination
cites work: Inferring Evolutionary History From DNA Sequences
cites work: The use of sample genealogies for studying a selectively neutral m-loci model with recombination
cites work: Q3128908
cites work: Q4886096
cites work: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
cites work: Evolutionary trees and admixture: phylogenetic inference when some populations are hybridized
cites work: An Extension of the String-to-String Correction Problem
cites work: On the hardness of approximating minimization problems
cites work: An algorithm for a merge recognition problem
cites work: On the computational complexity of a merge recognition problem
cites work: Sequence comparison with concave weighting functions
cites work: Q4509227
cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization
cites work: Q4133128
cites work: On the complexity of iterated shuffle
cites work: Q3140442
description: scientific article; zbMATH DE number 1268163