Mingfu Shao

Orcid: 0000-0001-6112-5139

According to our database1, Mingfu Shao authored at least 23 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Anchorage Accurately Assembles Anchor-Flanked Synthetic Long Reads.
Proceedings of the 24th International Workshop on Algorithms in Bioinformatics, 2024

Accurate Assembly of Circular RNAs with TERRACE.
Proceedings of the Research in Computational Molecular Biology, 2024

2023
Transcript assembly and annotations: Bias and adjustment.
PLoS Comput. Biol., December, 2023

Locality-sensitive bucketing functions for the edit distance.
Algorithms Mol. Biol., December, 2023

On the Maximal Independent Sets of k-mers with the Edit Distance.
CoRR, 2023

Seeding with minimized subsequence.
Bioinform., 2023

On the Maximal Independent Sets of <i>k</i>-mers with the Edit Distance.
Proceedings of the 14th ACM International Conference on Bioinformatics, 2023

On de novo Bridging Paired-end RNA-seq Data.
Proceedings of the 14th ACM International Conference on Bioinformatics, 2023

2022
Accurate assembly of multi-end RNA-seq data with Scallop2.
Nat. Comput. Sci., 2022

2020
Context-aware seeds for read mapping.
Algorithms Mol. Biol., 2020

2019
Theory and A Heuristic for the Minimum Path Flow Decomposition Problem.
IEEE ACM Trans. Comput. Biol. Bioinform., 2019

2017
On Computing Breakpoint Distances for Genomes with Duplicate Genes.
J. Comput. Biol., 2017

DeepBound: accurate identification of transcript boundaries via deep convolutional neural fields.
Bioinform., 2017

2016
A Fast and Exact Algorithm for the Exemplar Breakpoint Distance.
J. Comput. Biol., 2016

A maximum-likelihood approach for building cell-type trees by lifting.
BMC Genom., 2016

2015
Models and Algorithms for Comparative Genomics.
PhD thesis, 2015

An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes.
J. Comput. Biol., 2015

Comparing genomes with rearrangements and segmental duplications.
Bioinform., 2015

2014
An Exact Algorithm to Compute the DCJ Distance for Genomes with Duplicate Genes.
Proceedings of the Research in Computational Molecular Biology, 2014

On the DCJ Median Problem.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013
Sorting genomes with rearrangements and segmental duplications through trajectory graphs.
BMC Bioinform., 2013

2012
Approximating the edit distance for genomes with duplicate genes under DCJ, insertion and deletion.
BMC Bioinform., 2012

2011
Incorporating Ab Initio energy into threading approaches for protein structure prediction.
BMC Bioinform., 2011


  Loading...