default search action
Haodi Feng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Aizhong Zhou, Haodi Feng, Jiong Guo, Haitao Jiang, Nan Liu, Binhai Zhu, Daming Zhu:
New approximation algorithms for RNA secondary structures prediction problems by local search. Theor. Comput. Sci. 988: 114354 (2024) - [c26]Yu Zhang, Yang Zhou, Haodi Feng, Daming Zhu:
FOKHic: A Framework of ${\varvec{k}}$-mer Based Hierarchical Classification. ICIC (LNAI 6) 2024: 86-96 - 2023
- [c25]Yuyang Wang, Haitao Jiang, Haodi Feng, Daming Zhu:
Minimize Maximum Coverage of Fragment Alignment Selection. BIBM 2023: 349-354 - 2022
- [j14]Jin Zhao
, Haodi Feng
MultiTrans: An Algorithm for Path Extraction Through Mixed Integer Linear Programming for Transcriptome Assembly. IEEE ACM Trans. Comput. Biol. Bioinform. 19(1): 48-56 (2022) - [j13]Shengjun Xie, Haodi Feng, Haitao Jiang, Daming Zhu:
Approximation algorithms for sorting by bounded singleton moves. Theor. Comput. Sci. 917: 51-65 (2022) - [c24]Tiantian Li, Daming Zhu, Haitao Jiang, Haodi Feng, Xuefeng Cui:
Longest k-tuple Common Sub-Strings. BIBM 2022: 63-66 - [c23]Yu Zhang, Chenchen Li, Haodi Feng, Daming Zhu:
DLmeta: a deep learning method for metagenomic identification. BIBM 2022: 303-308 - 2021
- [j12]Shu Zhang, Daming Zhu
Sorting a Permutation by Best Short Swaps. Algorithmica 83(7): 1953-1979 (2021) - [c22]Chenchen Li, Jin Zhao, Haodi Feng, Daming Zhu:
TransCoord: Genome-guided Transcripts Assembly by Coordinating Candidate Paths into Two-phased Linear Programming. BIBM 2021: 296-301 - 2020
- [j11]Jin Zhao
IsoTree: A New Framework for de novo Transcriptome Assembly from RNA-seq Reads. IEEE ACM Trans. Comput. Biol. Bioinform. 17(3): 938-948 (2020) - [j10]Jin Zhao
Corrections to "IsoTree: A New Framework for de novo Transcriptome Assembly from RNA-seq Reads". IEEE ACM Trans. Comput. Biol. Bioinform. 17(6): 2197 (2020)
2010 – 2019
- 2019
- [j9]Jin Zhao, Haodi Feng, Daming Zhu, Chi Zhang, Ying Xu:
DTA-SiST: de novo transcriptome assembly by using simplified suffix trees. BMC Bioinform. 20-S(25): 698 (2019) - [c21]Shengjun Xie, Haodi Feng, Haitao Jiang, Junfeng Luan, Daming Zhu:
An Approximation Algorithm for Sorting by Bounded Singleton Moves. COCOON 2019: 580-590 - 2018
- [j8]Xingfu Li, Haodi Feng, Haitao Jiang, Binhai Zhu:
Solving the maximum internal spanning tree problem on interval graphs in polynomial time. Theor. Comput. Sci. 734: 32-37 (2018) - [c20]Shu Zhang, Ruizhi Wang, Daming Zhu, Haitao Jiang, Haodi Feng, Jiong Guo, Xiaowen Liu
The Longest Common Exemplar Subsequence Problem. BIBM 2018: 92-95 - [c19]Shu Zhang, Daming Zhu, Haitao Jiang, Jingjing Ma, Jiong Guo, Haodi Feng:
Can a permutation be sorted by best short swaps?. CPM 2018: 14:1-14:12 - [c18]Huiqiang Jia, Haichao Wei, Daming Zhu, Ruizhi Wang, Haodi Feng, Xiangzhong Feng
PASA: Identifying More Credible Structural Variants of Hedou12. ICIC (1) 2018: 553-558 - [c17]Jin Zhao, Haodi Feng, Daming Zhu, Chi Zhang, Ying Xu:
DTAST: A Novel Radical Framework for de Novo Transcriptome Assembly Based on Suffix Trees. ICIC (1) 2018: 740-745 - 2017
- [c16]Aizhong Zhou, Haitao Jiang, Jiong Guo, Haodi Feng, Nan Liu, Binhai Zhu:
Improved Approximation Algorithm for the Maximum Base Pair Stackings Problem in RNA Secondary Structures Prediction. COCOON 2017: 575-587 - [c15]Jin Zhao, Haodi Feng, Daming Zhu, Chi Zhang, Ying Xu:
IsoTree: De Novo Transcriptome Assembly from RNA-Seq Reads - (Extended Abstract). ISBRA 2017: 71-83 - 2016
- [c14]Jin Zhao, Haodi Feng:
Estimating isoform abundance by Particle Swarm Optimization. BIBM 2016: 161-166 - [c13]Xingfu Li, Haodi Feng, Haitao Jiang, Binhai Zhu:
A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs. FAW 2016: 92-101 - 2014
- [c12]Haitao Jiang, Haodi Feng, Daming Zhu:
An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves. ISAAC 2014: 491-503 - 2010
- [j7]Shenpeng Lu, Haodi Feng, Xiuqian Li:
Minimizing the makespan on a single parallel batching machine. Theor. Comput. Sci. 411(7-9): 1140-1145 (2010)
2000 – 2009
- 2009
- [j6]Hong Liu, Haodi Feng, Daming Zhu, Junfeng Luan:
Parameterized computational complexity of control problems in voting systems. Theor. Comput. Sci. 410(27-29): 2746-2753 (2009) - [c11]Haodi Feng, Hong Liu:
Minimizing Makespan on an Unbounded Parallel Batch Processor with Rejection and Release Times. CSIE (2) 2009: 587-590 - [c10]Hong Liu, Haodi Feng, Daming Zhu:
Parameterized Complexity of Finding Elementary Modes in Metabolic Networks. IJCBS 2009: 479-482 - 2008
- [c9]Zhaofeng Su, Hongze Qiu, Daming Zhu, Haodi Feng:
New Evolutionary Subset: Application to Symbiotic Evolutionary Algorithm for Job-Shop Scheduling Problem. ICNC (1) 2008: 470-475 - 2007
- [c8]Hong Liu, Haodi Feng, Daming Zhu:
Prediction of Protein Subcellular Locations by Combining K-Local Hyperplane Distance Nearest Neighbor. ADMA 2007: 345-351 - 2005
- [j5]Xiaotie Deng
A PTAS for Semiconductor Burn-in Scheduling. J. Comb. Optim. 9(1): 5-17 (2005) - 2004
- [j4]Xiaotie Deng
Minimizing Mean Completion Time in a Batch Processing System. Algorithmica 38(4): 513-528 (2004) - [j3]Haodi Feng, Kang Chen, Xiaotie Deng
Accessor Variety Criteria for Chinese Word Extraction. Comput. Linguistics 30(1): 75-93 (2004) - [c7]Haodi Feng, Kang Chen, Chunyu Kit, Xiaotie Deng:
Unsupervised Segmentation of Chinese Corpus Using Accessor Variety. IJCNLP 2004: 694-703 - 2002
- [j2]Xiaotie Deng
A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. Int. J. Found. Comput. Sci. 13(6): 817-827 (2002) - [j1]Haodi Feng, Guizhen Liu:
Orthogonal factorizations of graphs. J. Graph Theory 40(4): 267-276 (2002) - [c6]Mao-cheng Cai, Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu:
A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. IPCO 2002: 304-314 - [c5]Kang Chen, Weimin Zheng, Xiaotie Deng, Haodi Feng, Shanfeng Zhu:
Text Distinguishers Used in an Interactive Meta Search Engine. WAIM 2002: 181-188 - 2001
- [c4]Haodi Feng:
Some Results on Orthogonal Factorizations. COCOON 2001: 414-419 - [c3]Kang Chen, Weimin Zheng, Hung Chim, Xiaotie Deng
On-Line Selection Of Distinguishing Elements For Focused Information Retrieval. ICME 2001 - [c2]Xiaotie Deng
A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling. ISAAC 2001: 26-35 - [c1]Haodi Feng:
(g, f)-Factorizations Orthogonal to k Subgraphs. WG 2001: 129-139
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 2024-08-10 00:30 CEST 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: