Yun S. Song

According to our database1, Yun S. Song authored at least 35 papers between 2003 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A fast machine-learning-guided primer design pipeline for selective whole genome amplification.
PLoS Comput. Biol., 2023

2021
Parallelizing Contextual Linear Bandits.
CoRR, 2021

Enzyme Activity Prediction of Sequence Variants on Novel Substrates using Improved Substrate Encodings and Convolutional Pooling.
Proceedings of the Machine Learning in Computational Biology Meeting, 2021

2019
Evaluating Protein Transfer Learning with TAPE.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018
A Likelihood-Free Inference Framework for Population Genetic Data using Exchangeable Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Tensor Decompositions via Two-Mode Higher-Order SVD (HOSVD).
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

2016
Deep Learning for Population Genetic Inference.
PLoS Comput. Biol., 2016

Estimating Copy Number and Allelic Variation at the Immunoglobulin Heavy Chain Locus Using Short Reads.
PLoS Comput. Biol., 2016

Orthogonal Tensor Decompositions via Two-Mode Higher-Order SVD (HOSVD).
CoRR, 2016

SpectralTDF: transition densities of diffusion processes with time-varying selection parameters, mutation rates and effective population sizes.
Bioinform., 2016

Prediction of ribosome footprint profile shapes from transcript sequences.
Bioinform., 2016

2014
diCal-IBD: demography-aware inference of identity-by-descent tracts in unrelated individuals.
Bioinform., 2014

SMaSH: a benchmarking toolkit for human genome variant calling.
Bioinform., 2014

Decoding Coalescent Hidden Markov Models in Linear Time.
Proceedings of the Research in Computational Molecular Biology, 2014

Changepoint Analysis for Efficient Variant Calling.
Proceedings of the Research in Computational Molecular Biology, 2014

2012
Blockwise HMM computation for large-scale population genomic inference.
Bioinform., 2012

Telescoper: <i>de novo</i> assembly of highly repetitive regions.
Bioinform., 2012

2011
On the Genealogy of Asexual Diploids.
J. Comput. Biol., 2011

naiveBayesCall: An Efficient Model-Based Base-Calling Algorithm for High-Throughput Sequencing.
J. Comput. Biol., 2011

2010
SeqHive: A Reconfigurable Computer Cluster for Genome Re-sequencing.
Proceedings of the International Conference on Field Programmable Logic and Applications, 2010

Application of a reconfigurable computing cluster to ultra high throughput genome resequencing (abstract only).
Proceedings of the ACM/SIGDA 18th International Symposium on Field Programmable Gate Arrays, 2010

2009
Joint estimation of gene conversion rates and mean conversion tract lengths from population SNP data.
Bioinform., 2009

Multi-locus match probability in a finite population: a fundamental difference between the Moran and Wright-Fisher models.
Bioinform., 2009

2008
Efficient whole-genome association mapping using local phylogenies for unphased genotype data.
Bioinform., 2008

Accurate Computation of Likelihoods in the Coalescent with Recombination Via Parsimony.
Proceedings of the Research in Computational Molecular Biology, 2008

2007
Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations.
J. Comput. Biol., 2007

A Decomposition Theory for Phylogenetic Networks and Incompatible Characters.
J. Comput. Biol., 2007

2006
Counting All Possible Ancestral Configurations of Sample Sequences in Population Genetics.
IEEE ACM Trans. Comput. Biol. Bioinform., 2006

A Concise Necessary and Sufficient Condition for the Existence of a Galled-Tree.
IEEE ACM Trans. Comput. Biol. Bioinform., 2006

2005
Constructing Minimal Ancestral Recombination Graphs.
J. Comput. Biol., 2005

Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

Minimum Recombination Histories by Branch and Bound.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution.
Proceedings of the Proceedings Thirteenth International Conference on Intelligent Systems for Molecular Biology 2005, 2005

2003
An Efficient Algorithm for Statistical Multiple Alignment on Arbitrary Phylogenetic Trees.
J. Comput. Biol., 2003

Parsimonious Reconstruction of Sequence Evolution and Haplotype Blocks.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003


  Loading...