Monthly Archives: September 2007

References for Interval Paper

Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution, Yun S. Song, Yufeng Wu and Dan Gusfield, Bioinformatics 2005 21(Suppl 1): i413-i422. A linear-time algorithm for the perfect phylogeny haplotyping (PPH)

Posted in Uncategorized

Ideas about the new phylogeny tree construction algorithm

  The new algorithm processes SNPs one by one and constructs a phylogeny tree. Here is an example to illustrate the basic idea of the algorithm. Example data: (4 strains, a,b,c and d. Each row is a strain, each column

Posted in Ideas, Research