Neng Huang

Orcid: 0000-0002-5669-2646

According to our database1, Neng Huang authored at least 23 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Hardness of sampling for the anti-ferromagnetic Ising model on random graphs.
CoRR, 2024

Tight approximability of MAX 2-SAT and relatives, under UGC.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
compleasm: a faster and more accurate reimplementation of BUSCO.
Bioinform., October, 2023

NanoSNP: a progressive and haplotype-aware SNP caller on low-coverage nanopore sequencing data.
Bioinform., January, 2023

Local algorithms and the failure of log-depth quantum advantage on sparse random CSPs.
CoRR, 2023

Separating MAX 2-AND, MAX DI-CUT and MAX CUT.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
SACall: A Neural Network Basecaller for Oxford Nanopore Sequencing Data Based on Self-Attention Mechanism.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022

Fec: a fast error correction method based on two-rounds overlapping and caching.
Bioinform., 2022

BlockPolish: accurate polishing of long-read assembly via block divide-and-conquer.
Briefings Bioinform., 2022

2021
A Novel Hash Chain-Based Data Availability Monitoring Method for Off-site Disaster Recovery Architecture.
J. Circuits Syst. Comput., 2021

NeuralPolish: a novel Nanopore polishing method based on alignment matrix construction and orthogonal Bi-GRU Networks.
Bioinform., 2021

MultiNanopolish: refined grouping method for reducing redundant calculations in Nanopolish.
Bioinform., 2021

On the Mysteries of MAX NAE-SAT.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
New kernels for several problems on planar graphs.
Theor. Comput. Sci., 2020

On the Approximability of Presidential Type Predicates.
Proceedings of the Approximation, 2020

2019
Improved PTAS for the constrained k-means problem.
J. Comb. Optim., 2019

DeepSignal: detecting DNA methylation state from Nanopore sequencing reads using deep-learning.
Bioinform., 2019

An attention-based neural network basecaller for Oxford Nanopore sequencing data.
Proceedings of the 2019 IEEE International Conference on Bioinformatics and Biomedicine, 2019

2018
Dealing with several parameterized problems by random methods.
Theor. Comput. Sci., 2018

The idemetric property: when most distances are (almost) the same.
CoRR, 2018

Improved Kernels for Several Problems on Planar Graphs.
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

On the Decision Tree Complexity of String Matching.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2013
FRESA: A Frequency-Sensitive Sampling-Based Approach for Data Race Detection.
Proceedings of the Network and Parallel Computing - 10th IFIP International Conference, 2013


  Loading...