Yufeng Wu
Orcid: 0000-0003-4988-3521Affiliations:
- University of Connecticut, Department of Computer Science and Engineering, Storrs, CT, USA
According to our database1,
Yufeng Wu authored at least 42 papers
between 2005 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Bounding the number of reticulation events for displaying multiple trees in a phylogenetic network.
J. Comput. Syst. Sci., 2025
ScisTree2: An Improved Method for Large-Scale Inference of Cell Lineage Trees and Genotype Calling from Noisy Single Cell Data.
Proceedings of the Research in Computational Molecular Biology, 2025
2024
Computing the Bounds of the Number of Reticulations in a Tree-Child Network That Displays a Set of Trees.
J. Comput. Biol., 2024
2023
Bounding the Number of Reticulations in a Tree-Child Network that Displays a Set of Trees.
Proceedings of the Comparative Genomics - 20th International Conference, 2023
2022
Detecting genomic deletions from high-throughput sequence data with unsupervised learning.
BMC Bioinform., December, 2022
2020
PLoS Comput. Biol., 2020
Inference of population admixture network from local gene genealogies: a coalescent-based maximum likelihood approach.
Bioinform., 2020
Accurate and efficient cell lineage tree inference from noisy single cell data: the maximum likelihood perfect phylogeny approach.
Bioinform., 2020
scSNVIndel. accurate and efficient calling of SNVs and indels from single cell sequencing using integrated Bi-LSTM.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2020
2019
DeepSV: accurate calling of genomic deletions from high-throughput sequencing data using deep convolutional neural network.
BMC Bioinform., 2019
2017
Concod: an effective integration framework of consensus-based calling deletions from next-generation sequencing data.
Int. J. Data Min. Bioinform., 2017
STELLS2: fast and accurate coalescent-based maximum likelihood inference of species trees from gene tree topologies.
Bioinform., 2017
RENT+: an improved method for inferring local genealogical trees from haplotypes with recombination.
Bioinform., 2017
GAPPadder: A sensitive approach for closing gaps on draft genomes with short sequence reads.
Proceedings of the 7th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2017
2016
Fast Construction of Near Parsimonious Hybridization Networks for Multiple Phylogenetic Trees.
IEEE ACM Trans. Comput. Biol. Bioinform., 2016
An algorithm for computing the gene tree probability under the multispecies coalescent and its application in the inference of population tree.
Bioinform., 2016
Concod: Accurate consensus-based approach of calling deletions from high-throughput sequencing data.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2016
2015
SpliceJumper: a classification-based approach for calling splicing junctions from RNA-seq data.
BMC Bioinform., December, 2015
Bioinform., 2015
2014
Proceedings of the IEEE 4th International Conference on Computational Advances in Bio and Medical Sciences, 2014
2013
An Algorithm for Constructing Parsimonious Hybridization Networks with Multiple Phylogenetic Trees.
Proceedings of the Research in Computational Molecular Biology, 2013
An SVM-based approach for genotyping deletions and insertions with population sequence reads.
Proceedings of the IEEE 3rd International Conference on Computational Advances in Bio and Medical Sciences, 2013
2012
An improved approach for accurate and efficient calling of structural variations with low-coverage sequence data.
BMC Bioinform., 2012
2011
New Methods for Inference of Local Tree Topologies with Recombinant SNP Sequences in Populations.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011
Linkage disequilibrium based genotype calling from low-coverage shotgun sequencing reads.
BMC Bioinform., 2011
SVseq: an approach for detecting exact breakpoints of deletions with low-coverage sequence data.
Bioinform., 2011
Haplotype Inference from Single Short Sequence Reads Using a Population Genealogical History Model.
Proceedings of the Biocomputing 2011: Proceedings of the Pacific Symposium, 2011
Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011
2010
Exact Computation of Coalescent Likelihood for Panmictic and Subdivided Populations under the Infinite Sites Model.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010
Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees.
Bioinform., 2010
Proceedings of the Bioinformatics Research and Applications, 6th International Symposium, 2010
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010
2009
An analytical upper bound on the minimum number of recombinations in the history of SNP sequences in populations.
Inf. Process. Lett., 2009
Bioinform., 2009
2007
J. Bioinform. Comput. Biol., 2007
Association Mapping of Complex Diseases with Ancestral Recombination Graphs: Models and Efficient Algorithms.
Proceedings of the Research in Computational Molecular Biology, 2007
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007
2006
Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations.
Proceedings of the Research in Computational Molecular Biology, 2006
2005
Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event.
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