Publications of Yun S. Song

Basecaller for the Illumina Platform

BayesCall [ Link ]
Software accompaniment to "Kao, W.C., Stevens, K. and Song, Y.S. BayesCall: A model-based basecalling algorithm for high-throughput short-read sequencing. Genome Research, 19 (2009) 1884-1895."

Two-Locus Asymptotic Sampling Formula

ASF [ Link ]
Software accompaniment to "Jenkins, P.A. and Song, Y.S. Closed-form two-locus sampling distributions: accuracy and universality Genetics, in press, 2009."

Gene Conversion

overpaint [ Link ]
Software accompaniment to "Yin, J. Jordan, M. I., and Song, Y. S.. Joint estimation of gene conversion rates and mean conversion tract lengths from population SNP data, Proceedings of ISMB 2009, Bioinformatics, 25 (2009) i231-i239."

Multi-locus Match Probability

Wright_Fisher_MP and Moran_MP [ Link ]
Software accompaniment to "Bhaskar, A. and Song, Y.S. Multi-locus match probability in a finite population: A fundamental difference between the Moran and Wright-Fisher models. Proceedings of ISMB 2009, Bioinformatics, 25 (2009) i187-i195."

Estimating Recombination Rates

COB [ Link ]
Software accompaniment to "Lyngsø, R., Song, Y.S., and Hein, J. Accurate computation of likelihoods in the coalescent with recombination via parsimony. Proc. 12th Annual Intl. Conf. on Research in Computational Molecular Biology (RECOMB 2008), Lecture Notes in Computer Science 4955, pages 463--477."

COB is a parsimony-based method of computing likelihoods accurately under the coalescent with recombination.

Whole-Genome Association Mapping

BLOSSOC [ Link ]
Software accompaniment to "Ding, Z., Mailund, T., and Song, Y.S. Efficient whole-genome association mapping using local phylogenies for unphased genotype data. Bioinformatics, 24 (2008) 2215-2221."

This program combines a recently found linear-time algorithm for phasing genotypes on trees with a tree-based method for association mapping. From unphased genotype data, our algorithm builds local phylogenies along the genome, and scores each tree according to the clustering of cases and controls.

Detecting Crossover Recombination

HapBound and SHRUB [ Link ]
Software accompaniment to "Song, Y.S., Wu, Y. and Gusfield, D. Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution, Proceedings of ISMB 2005. Bioinformatics, 21, Suppl.1, (2005) i413-i422."

HapBound and SHRUB respectively compute lower and upper bounds on the minimum number of crossover recombinations. SHRUB constructs an ancestral recombination graph for the input data.
Beagle [ Link ]
Software accompaniment to "Lyngsø, R., Song, Y.S., and Hein, J. Minimum Recombination Histories by Branch and Bound. Proceedings of WABI 2005, Lecture Notes in Computer Science, 3692, pp. 239-250."

Beagle computes the minimum number of crossover recombinations. It also produces an ancestral recombination graph.

Detecting Crossover and Gene-Conversion Recombinations

HapBound-GC and SHRUB-GC [ Link ]
Software accompaniment to "Song, Y.S., Ding, Z., Gusfield, D., Langley, C.H., and Wu, Y. Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations Proceedings of RECOMB 2006. Lecture Notes in Computer Science 3909, (2006) 231-245."

HapBound-GC and SHRUB-GC respectively compute lower and upper bounds on the minimum combined number of crossover and gene-conversion recombinations. SHRUB-GC constructs a graphical representation of evolutionary history involving coalescent, mutation, crossover and gene-conversion events.