Haodi Feng

Orcid: 0000-0002-0656-5905

According to our database1, Haodi Feng authored at least 41 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
New approximation algorithms for RNA secondary structures prediction problems by local search.
Theor. Comput. Sci., 2024

FOKHic: A Framework of ${\varvec{k}}$-mer Based Hierarchical Classification.
Proceedings of the Advanced Intelligent Computing Technology and Applications, 2024

2023
Minimize Maximum Coverage of Fragment Alignment Selection.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2023

2022
Approximation algorithms for sorting by bounded singleton moves.
Theor. Comput. Sci., 2022

MultiTrans: An Algorithm for Path Extraction Through Mixed Integer Linear Programming for Transcriptome Assembly.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022

DLmeta: a deep learning method for metagenomic identification.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2022

Longest k-tuple Common Sub-Strings.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2022

2021
Sorting a Permutation by Best Short Swaps.
Algorithmica, 2021

TransCoord: Genome-guided Transcripts Assembly by Coordinating Candidate Paths into Two-phased Linear Programming.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2021

2020
Corrections to "IsoTree: A New Framework for de novo Transcriptome Assembly from RNA-seq Reads".
IEEE ACM Trans. Comput. Biol. Bioinform., 2020

IsoTree: A New Framework for de novo Transcriptome Assembly from RNA-seq Reads.
IEEE ACM Trans. Comput. Biol. Bioinform., 2020

2019
DTA-SiST: de novo transcriptome assembly by using simplified suffix trees.
BMC Bioinform., 2019

An Approximation Algorithm for Sorting by Bounded Singleton Moves.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018
Solving the maximum internal spanning tree problem on interval graphs in polynomial time.
Theor. Comput. Sci., 2018

DTAST: A Novel Radical Framework for de Novo Transcriptome Assembly Based on Suffix Trees.
Proceedings of the Intelligent Computing Theories and Application, 2018

PASA: Identifying More Credible Structural Variants of Hedou12.
Proceedings of the Intelligent Computing Theories and Application, 2018

Can a permutation be sorted by best short swaps?.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

The Longest Common Exemplar Subsequence Problem.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2018

2017
IsoTree: De Novo Transcriptome Assembly from RNA-Seq Reads - (Extended Abstract).
Proceedings of the Bioinformatics Research and Applications - 13th International Symposium, 2017

Improved Approximation Algorithm for the Maximum Base Pair Stackings Problem in RNA Secondary Structures Prediction.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016
A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs.
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

Estimating isoform abundance by Particle Swarm Optimization.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2016

2014
An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2010
Minimizing the makespan on a single parallel batching machine.
Theor. Comput. Sci., 2010

2009
Parameterized computational complexity of control problems in voting systems.
Theor. Comput. Sci., 2009

Parameterized Complexity of Finding Elementary Modes in Metabolic Networks.
Proceedings of the International Joint Conferences on Bioinformatics, 2009

Minimizing Makespan on an Unbounded Parallel Batch Processor with Rejection and Release Times.
Proceedings of the CSIE 2009, 2009 WRI World Congress on Computer Science and Information Engineering, March 31, 2009

2008
New Evolutionary Subset: Application to Symbiotic Evolutionary Algorithm for Job-Shop Scheduling Problem.
Proceedings of the Fourth International Conference on Natural Computation, 2008

2007
Prediction of Protein Subcellular Locations by Combining K-Local Hyperplane Distance Nearest Neighbor.
Proceedings of the Advanced Data Mining and Applications, Third International Conference, 2007

2005
A PTAS for Semiconductor Burn-in Scheduling.
J. Comb. Optim., 2005

2004
Accessor Variety Criteria for Chinese Word Extraction.
Comput. Linguistics, 2004

Minimizing Mean Completion Time in a Batch Processing System.
Algorithmica, 2004

Unsupervised Segmentation of Chinese Corpus Using Accessor Variety.
Proceedings of the Natural Language Processing, 2004

2002
Orthogonal factorizations of graphs.
J. Graph Theory, 2002

A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling.
Int. J. Found. Comput. Sci., 2002

Text Distinguishers Used in an Interactive Meta Search Engine.
Proceedings of the Advances in Web-Age Information Management, 2002

A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling.
Proceedings of the Integer Programming and Combinatorial Optimization, 2002

2001
(g, f)-Factorizations Orthogonal to k Subgraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

On-Line Selection Of Distinguishing Elements For Focused Information Retrieval.
Proceedings of the 2001 IEEE International Conference on Multimedia and Expo, 2001

Some Results on Orthogonal Factorizations.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001


  Loading...