Search the dblp DataBase

Publications of Author

1. Yun S. Song, Yufeng Wu, Dan Gusfield
   Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution. [Citation Graph (0, 0)][DBLP]
   ISMB (Supplement of Bioinformatics), 2005, pp:413-422 [Conf]
   
2. Yun S. Song, Zhihong Ding, Dan Gusfield, Charles H. Langley, Yufeng Wu
   Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations. [Citation Graph (0, 0)][DBLP]
   RECOMB, 2006, pp:231-245 [Conf]
   
3. Rune B. Lyngsø, Yun S. Song, Jotun Hein
   Minimum Recombination Histories by Branch and Bound. [Citation Graph (0, 0)][DBLP]
   WABI, 2005, pp:239-250 [Conf]
   
4. Yun S. Song, Jotun Hein
   Parsimonious Reconstruction of Sequence Evolution and Haplotype Blocks. [Citation Graph (0, 0)][DBLP]
   WABI, 2003, pp:287-302 [Conf]
   
5. Yun S. Song, Yufeng Wu, Dan Gusfield
   Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event. [Citation Graph (0, 0)][DBLP]
   WABI, 2005, pp:152-164 [Conf]
   
6. Gerton Lunter, István Miklós, Yun S. Song, Jotun Hein
   An Efficient Algorithm for Statistical Multiple Alignment on Arbitrary Phylogenetic Trees. [Citation Graph (0, 0)][DBLP]
   Journal of Computational Biology, 2003, v:10, n:6, pp:869-889 [Journal]
   
7. Yun S. Song, Jotun Hein
   Constructing Minimal Ancestral Recombination Graphs. [Citation Graph (0, 0)][DBLP]
   Journal of Computational Biology, 2005, v:12, n:2, pp:147-169 [Journal]
   
8. Yun S. Song, Rune B. Lyngsø, Jotun Hein
   Counting All Possible Ancestral Configurations of Sample Sequences in Population Genetics. [Citation Graph (0, 0)][DBLP]
   IEEE/ACM Trans. Comput. Biology Bioinform., 2006, v:3, n:3, pp:239-251 [Journal]
   
9. Yun S. Song
   A Concise Necessary and Sufficient Condition for the Existence of a Galled-Tree. [Citation Graph (0, 0)][DBLP]
   IEEE/ACM Trans. Comput. Biology Bioinform., 2006, v:3, n:2, pp:186-191 [Journal]
   
10. 
    Application of a reconfigurable computing cluster to ultra high throughput genome resequencing (abstract only). [Citation Graph (, )][DBLP]
    
    
11. 
    Accurate Computation of Likelihoods in the Coalescent with Recombination Via Parsimony. [Citation Graph (, )][DBLP]
    
    
12. 
    naiveBayesCall: An Efficient Model-Based Base-Calling Algorithm for High-Throughput Sequencing. [Citation Graph (, )][DBLP]
    
    
13. 
    On the Genealogy of Asexual Diploids. [Citation Graph (, )][DBLP]
    
    
14. 
    Efficient whole-genome association mapping using local phylogenies for unphased genotype data. [Citation Graph (, )][DBLP]
    
    
15. 
    Multi-locus match probability in a finite population: a fundamental difference between the Moran and Wright-Fisher models. [Citation Graph (, )][DBLP]
    
    
16. 
    Joint estimation of gene conversion rates and mean conversion tract lengths from population SNP data. [Citation Graph (, )][DBLP]