default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYufeng Wu 0001
Person information
- affiliation: University of Connecticut, Department of Computer Science and Engineering, Storrs, CT, USA
Other persons with the same name
- Yufeng Wu — disambiguation page
- Yufeng Wu 0002
![[0000-0002-1842-1677]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-1842-1677")
— City University of Hong Kong, Department of Linguistics and Translation, Hong Kong
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j28]Yufeng Wu, Louxin Zhang:
Bounding the number of reticulation events for displaying multiple trees in a phylogenetic network. J. Comput. Syst. Sci. 152: 103657 (2025)- [c18]Haotian Zhang, Yiming Zhang, Teng Gao, Yufeng Wu:
ScisTree2: An Improved Method for Large-Scale Inference of Cell Lineage Trees and Genotype Calling from Noisy Single Cell Data. RECOMB 2025: 277-280 - 2024
- [j27]Yufeng Wu, Louxin Zhang:
Computing the Bounds of the Number of Reticulations in a Tree-Child Network That Displays a Set of Trees. J. Comput. Biol. 31(4): 345-359 (2024) - 2023
- [c17]Yufeng Wu, Louxin Zhang:
Bounding the Number of Reticulations in a Tree-Child Network that Displays a Set of Trees. RECOMB-CG 2023: 162-178 - 2022
- [j26]Xin Li, Yufeng Wu:
Detecting genomic deletions from high-throughput sequence data with unsupervised learning. BMC Bioinform. 23-S(8): 568 (2022) - 2020
- [j25]Yufeng Wu:
Accurate and efficient cell lineage tree inference from noisy single cell data: the maximum likelihood perfect phylogeny approach. Bioinform. 36(3): 742-750 (2020) - [j24]Yufeng Wu:
Inference of population admixture network from local gene genealogies: a coalescent-based maximum likelihood approach. Bioinform. 36(Supplement-1): i326-i334 (2020) - [j23]Jingwen Pei, Yiming Zhang, Rasmus Nielsen, Yufeng Wu:
Inferring the ancestry of parents and grandparents from genetic data. PLoS Comput. Biol. 16(8) (2020) - [c16]Lei Cai, Yufeng Wu, Jingyang Gao:
scSNVIndel. accurate and efficient calling of SNVs and indels from single cell sequencing using integrated Bi-LSTM. BIBM 2020: 173-179
2010 – 2019
- 2019
- [j22]Lei Cai, Yufeng Wu, Jingyang Gao:
DeepSV: accurate calling of genomic deletions from high-throughput sequencing data using deep convolutional neural network. BMC Bioinform. 20(1): 665 (2019) - 2017
- [j21]Sajad Mirzaei, Yufeng Wu:
RENT+: an improved method for inferring local genealogical trees from haplotypes with recombination. Bioinform. 33(7): 1021-1030 (2017) - [j20]Jingwen Pei, Yufeng Wu:
STELLS2: fast and accurate coalescent-based maximum likelihood inference of species trees from gene tree topologies. Bioinform. 33(12): 1789-1797 (2017) - [j19]Lei Cai, Chong Chu, Xiaodong Zhang, Yufeng Wu, Jingyang Gao:
Concod: an effective integration framework of consensus-based calling deletions from next-generation sequencing data. Int. J. Data Min. Bioinform. 17(2): 153-172 (2017) - [c15]Chong Chu, Xin Li, Yufeng Wu:
GAPPadder: A sensitive approach for closing gaps on draft genomes with short sequence reads. ICCABS 2017: 1 - 2016
- [j18]Yufeng Wu:
An algorithm for computing the gene tree probability under the multispecies coalescent and its application in the inference of population tree. Bioinform. 32(12): 225-233 (2016) - [j17]Sajad Mirzaei, Yufeng Wu:
Fast Construction of Near Parsimonious Hybridization Networks for Multiple Phylogenetic Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 13(3): 565-570 (2016) - [c14]Xiaodong Zhang, Chong Chu, Yao Zhang, Yufeng Wu, Jingyang Gao:
Concod: Accurate consensus-based approach of calling deletions from high-throughput sequencing data. BIBM 2016: 72-77 - 2015
- [j16]Yufeng Wu:
A coalescent-based method for population tree inference with haplotypes. Bioinform. 31(5): 691-698 (2015) - [j15]Chong Chu, Xin Li, Yufeng Wu:
SpliceJumper: a classification-based approach for calling splicing junctions from RNA-seq data. BMC Bioinform. 16(S17): S10 (2015) - 2014
- [c13]Chong Chu, Yufeng Wu:
An SVM-based approach for discovering splicing junctions with RNA-Seq. ICCABS 2014: 1 - 2013
- [j14]Yufeng Wu:
An Algorithm for Constructing Parsimonious Hybridization Networks with Multiple Phylogenetic Trees. J. Comput. Biol. 20(10): 792-804 (2013) - [c12]Chong Chu, Jin Zhang, Yufeng Wu:
An SVM-based approach for genotyping deletions and insertions with population sequence reads. ICCABS 2013: 1 - [c11]Yufeng Wu:
An Algorithm for Constructing Parsimonious Hybridization Networks with Multiple Phylogenetic Trees. RECOMB 2013: 291-303 - 2012
- [j13]Jin Zhang, Jiayin Wang, Yufeng Wu:
An improved approach for accurate and efficient calling of structural variations with low-coverage sequence data. BMC Bioinform. 13(S-6): S6 (2012) - 2011
- [j12]Jin Zhang, Yufeng Wu:
SVseq: an approach for detecting exact breakpoints of deletions with low-coverage sequence data. Bioinform. 27(23): 3228-3234 (2011) - [j11]Jorge Duitama, Justin Kennedy, Sanjiv Dinakar, Yözen Hernández, Yufeng Wu, Ion I. Mandoiu:
Linkage disequilibrium based genotype calling from low-coverage shotgun sequencing reads. BMC Bioinform. 12(S-1): S53 (2011) - [j10]Yufeng Wu:
New Methods for Inference of Local Tree Topologies with Recombinant SNP Sequences in Populations. IEEE ACM Trans. Comput. Biol. Bioinform. 8(1): 182-193 (2011) - [c10]Jiayin Wang, Jin Zhang, Yufeng Wu:
Identifying interacting SNPs with parallel fish-agent based logic regression. ICCABS 2011: 171-177 - [c9]Jin Zhang, Yufeng Wu:
Haplotype Inference from Single Short Sequence Reads Using a Population Genealogical History Model. Pacific Symposium on Biocomputing 2011: 288-299 - 2010
- [j9]Yufeng Wu:
Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees. Bioinform. 26(12): 140-148 (2010) - [j8]Yufeng Wu:
Exact Computation of Coalescent Likelihood for Panmictic and Subdivided Populations under the Infinite Sites Model. IEEE ACM Trans. Comput. Biol. Bioinform. 7(4): 611-618 (2010) - [c8]Yufeng Wu:
Bounds on the Minimum Mosaic of Population Sequences under Recombination. CPM 2010: 152-163 - [c7]Yufeng Wu, Jiayin Wang:
Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees. ISBRA 2010: 203-214
2000 – 2009
- 2009
- [j7]Yufeng Wu:
A practical method for exact computation of subtree prune and regraft distance. Bioinform. 25(2): 190-196 (2009) - [j6]Dan Gusfield, Yufeng Wu:
The Three-state Perfect Phylogeny Problem Reduces to 2-SAT. Commun. Inf. Syst. 9(4): 295-302 (2009) - [j5]Yufeng Wu:
An analytical upper bound on the minimum number of recombinations in the history of SNP sequences in populations. Inf. Process. Lett. 109(9): 427-431 (2009) - 2008
- [j4]Yufeng Wu:
Association Mapping of Complex Diseases with Ancestral Recombination Graphs: Models and Efficient Algorithms. J. Comput. Biol. 15(7): 667-684 (2008) - [j3]Yufeng Wu, Dan Gusfield:
A new recombination lower bound and the minimum perfect phylogenetic forest problem. J. Comb. Optim. 16(3): 229-247 (2008) - 2007
- [j2]Yufeng Wu, Dan Gusfield:
Efficient Computation of Minimum Recombination with genotypes (not Haplotypes). J. Bioinform. Comput. Biol. 5(2a): 181-200 (2007) - [j1]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. J. Comput. Biol. 14(10): 1273-1286 (2007) - [c6]Yufeng Wu, Dan Gusfield:
A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem. COCOON 2007: 16-26 - [c5]Yufeng Wu, Dan Gusfield:
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants. CPM 2007: 150-161 - [c4]Yufeng Wu:
Association Mapping of Complex Diseases with Ancestral Recombination Graphs: Models and Efficient Algorithms. RECOMB 2007: 488-502 - 2006
- [c3]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. RECOMB 2006: 231-245 - 2005
- [c2]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. ISMB (Supplement of Bioinformatics) 2005: 413-422 - [c1]Yun S. Song, Yufeng Wu, Dan Gusfield:
Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event. WABI 2005: 152-164
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-01-27 01:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
