default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMingfu Shao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Qian Shi
, Qimin Zhang, Mingfu Shao:
Accurate assembly of multiple RNA-seq samples with Aletsch. Bioinform. 40(Supplement_1): i307-i317 (2024)- [j16]Xin Yuan, Ke Chen, Xiang Li, Qian Shi, Mingfu Shao:
Learning locality-sensitive bucketing functions. Bioinform. 40(Supplement_1): i318-i327 (2024) - [c10]Tasfia Zahin, Qian Shi, Xiaofei Carl Zang, Mingfu Shao:
Accurate Assembly of Circular RNAs with TERRACE. RECOMB 2024: 444-447 - [c9]Xiaofei Carl Zang, Xiang Li, Kyle Metcalfe, Tuval Ben-Yehezkel, Ryan Kelley, Mingfu Shao:
Anchorage Accurately Assembles Anchor-Flanked Synthetic Long Reads. WABI 2024: 22:1-22:17 - 2023
- [j15]Ke Chen, Mingfu Shao:
Locality-sensitive bucketing functions for the edit distance. Algorithms Mol. Biol. 18(1): 7 (2023) - [j14]Xiang Li, Qian Shi, Ke Chen, Mingfu Shao:
Seeding with minimized subsequence. Bioinform. 39(Supplement-1): 232-241 (2023) - [j13]Qimin Zhang, Mingfu Shao:
Transcript assembly and annotations: Bias and adjustment. PLoS Comput. Biol. 19(12) (2023) - [c8]Xiang Li, Mingfu Shao:
On de novo Bridging Paired-end RNA-seq Data. BCB 2023: 41:1-41:5 - [c7]Leran Ma, Ke Chen, Mingfu Shao:
On the Maximal Independent Sets of k-mers with the Edit Distance. BCB 2023: 42:1-42:6 - [i3]Leran Ma, Ke Chen, Mingfu Shao:
On the Maximal Independent Sets of k-mers with the Edit Distance. CoRR abs/2303.10926 (2023) - [i2]Xiang Li, Mingfu Shao:
On de novo Bridging Paired-end RNA-seq Data. CoRR abs/2303.15594 (2023) - 2022
- [j12]Qimin Zhang, Qian Shi, Mingfu Shao:
Accurate assembly of multi-end RNA-seq data with Scallop2. Nat. Comput. Sci. 2(3): 148-152 (2022) - [c6]Ke Chen, Mingfu Shao:
Locality-Sensitive Bucketing Functions for the Edit Distance. WABI 2022: 22:1-22:14 - [i1]Ke Chen, Mingfu Shao:
Locality-sensitive bucketing functions for the edit distance. CoRR abs/2206.03097 (2022) - 2020
- [j11]Hongyi Xin, Mingfu Shao, Carl Kingsford:
Context-aware seeds for read mapping. Algorithms Mol. Biol. 15(1): 10 (2020)
2010 – 2019
- 2019
- [j10]Mingfu Shao, Carl Kingsford:
Theory and A Heuristic for the Minimum Path Flow Decomposition Problem. IEEE ACM Trans. Comput. Biol. Bioinform. 16(2): 658-670 (2019) - [c5]Hongyi Xin, Mingfu Shao, Carl Kingsford:
Context-Aware Seeds for Read Mapping. WABI 2019: 15:1-15:13 - 2017
- [j9]Mingfu Shao, Jianzhu Ma, Sheng Wang:
DeepBound: accurate identification of transcript boundaries via deep convolutional neural fields. Bioinform. 33(14): i267-i273 (2017) - [j8]Mingfu Shao, Bernard M. E. Moret:
On Computing Breakpoint Distances for Genomes with Duplicate Genes. J. Comput. Biol. 24(6): 571-580 (2017) - 2016
- [j7]Nishanth Ulhas Nair, Laura Hunter, Mingfu Shao, Paulina Grnarova, Yu Lin, Philipp Bucher, Bernard M. E. Moret:
A maximum-likelihood approach for building cell-type trees by lifting. BMC Genom. 17(S-1): 14 (2016) - [j6]Mingfu Shao, Bernard M. E. Moret:
A Fast and Exact Algorithm for the Exemplar Breakpoint Distance. J. Comput. Biol. 23(5): 337-346 (2016) - [c4]Mingfu Shao, Bernard M. E. Moret:
On Computing Breakpoint Distances for Genomes with Duplicate Genes. RECOMB 2016: 189-203 - 2015
- [b1]Mingfu Shao:
Models and Algorithms for Comparative Genomics. EPFL, Switzerland, 2015 - [j5]Mingfu Shao, Bernard M. E. Moret:
Comparing genomes with rearrangements and segmental duplications. Bioinform. 31(12): 329-338 (2015) - [j4]Mingfu Shao, Yu Lin, Bernard M. E. Moret:
An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes. J. Comput. Biol. 22(5): 425-435 (2015) - [c3]Mingfu Shao, Bernard M. E. Moret:
A Fast and Exact Algorithm for the Exemplar Breakpoint Distance. RECOMB 2015: 309-322 - 2014
- [c2]Mingfu Shao, Bernard M. E. Moret:
On the DCJ Median Problem. CPM 2014: 273-282 - [c1]Mingfu Shao, Yu Lin, Bernard M. E. Moret:
An Exact Algorithm to Compute the DCJ Distance for Genomes with Duplicate Genes. RECOMB 2014: 280-292 - 2013
- [j3]Mingfu Shao, Yu Lin, Bernard M. E. Moret:
Sorting genomes with rearrangements and segmental duplications through trajectory graphs. BMC Bioinform. 14(S-15): S9 (2013) - 2012
- [j2]Mingfu Shao, Yu Lin:
Approximating the edit distance for genomes with duplicate genes under DCJ, insertion and deletion. BMC Bioinform. 13(S-19): S13 (2012) - 2011
- [j1]Mingfu Shao, Sheng Wang, Chao Wang, Xiongying Yuan, Shuai Li, Wei-Mou Zheng, Dongbo Bu:
Incorporating Ab Initio energy into threading approaches for protein structure prediction. BMC Bioinform. 12(S-1): S54 (2011)
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 2025-03-27 00:05 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:
