Daming Zhu

Orcid: 0000-0001-9395-7247

According to our database1, Daming Zhu authored at least 133 papers between 1994 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Flanked Block-Interchange Distance on Strings.
IEEE ACM Trans. Comput. Biol. Bioinform., 2024

2023
ContactLib-ATT: A Structure-Based Search Engine for Homologous Proteins.
IEEE ACM Trans. Comput. Biol. Bioinform., 2023

Men Can't Always be Transformed into Mice: Decision Algorithms and Complexity for Sorting by Symmetric Reversals.
CoRR, 2023

On Sorting by Flanked Transpositions.
Proceedings of the Bioinformatics Research and Applications - 19th International Symposium, 2023

Cabbage Can't Always Be Transformed into Turnip: Decision Algorithms for Sorting by Symmetric Reversals.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Longest Order Conserved Repetition-free Subsequences.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2023

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

Improved Approximation Algorithms for Sorting Unsigned Genomes by Reversals.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2023

De Novo Molecular Structure Generation from Mass Spectra.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2023

2022
Identification and Analysis of Landslides in the Ahai Reservoir Area of the Jinsha River Basin Using a Combination of DS-InSAR, Optical Images, and Field Surveys.
Remote. Sens., December, 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

Algorithms and Hardness for Scaffold Filling to Maximize Increased Duo-Preservations.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022

mzMD: visualization-oriented MS data storage and retrieval.
Bioinform., 2022

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

Pretraining Transformers for TCR-pMHC Binding Prediction.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2022

Predicting Algorithm of Transcription Factor Binding Sites Based on Weighted Multi-Grained Scanning.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2022

Prediction Algorithm of DNA Sites Based on Weighted Feature Matrix.
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
Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs.
Theor. Comput. Sci., 2021

On the solution bound of two-sided scaffold filling.
Theor. Comput. Sci., 2021

Hyperspectral Prediction of Soil Total Salt Content by Different Disturbance Degree under a Fractional-Order Differential Model with Differing Spectral Transformations.
Remote. Sens., 2021

Study on the Pretreatment of Soil Hyperspectral and Na+ Ion Data under Different Degrees of Human Activity Stress by Fractional-Order Derivatives.
Remote. Sens., 2021

Estimation of Salinity Content in Different Saline-Alkali Zones Based on Machine Learning Model Using FOD Pretreatment Method.
Remote. Sens., 2021

A 43-approximation algorithm for the Maximum Internal Spanning Tree Problem.
J. Comput. Syst. Sci., 2021

SVLR: Genome Structural Variant Detection Using Long-Read Sequencing Data.
J. Comput. Biol., 2021

Sorting a Permutation by Best Short Swaps.
Algorithmica, 2021

mzMD: A New Storage and Retrieval System for Mass Spectrometry Data.
Proceedings of the Intelligent Computing Theories and Application, 2021

rzMLP-DTA: gMLP network with ReZero for sequence-based drug-target affinity prediction.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 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

Hydrogen bonds meet self-attention: all you need for protein structure embedding.
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

PASA: Identifying More Credible Structural Variants of Hedou12.
IEEE ACM Trans. Comput. Biol. Bioinform., 2020

Improved detection algorithm for copy number variations based on hidden Markov model.
Multim. Tools Appl., 2020

A 1.375-approximation algorithm for unsigned translocation sorting.
J. Comput. Syst. Sci., 2020

Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear Linear Programming-Rounding.
J. Comput. Biol., 2020

SVLR: Genome Structure Variant Detection Using Long Read Sequencing Data.
Proceedings of the Bioinformatics Research and Applications - 16th International Symposium, 2020

2019
An approximation algorithm for genome sorting by reversals to recover all adjacencies.
J. Comb. Optim., 2019

Combinatorial Detection Algorithm for Copy Number Variations Using High-throughput Sequencing Reads.
Int. J. Pattern Recognit. Artif. Intell., 2019

Improved predicting algorithm of RNA pseudoknotted structure.
Int. J. Comput. Sci. Eng., 2019

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

Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear LP-Rounding.
Proceedings of the Bioinformatics Research and Applications - 15th International Symposium, 2019

A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

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

2018
Preface.
Theor. Comput. Sci., 2018

Can a breakpoint graph be decomposed into none other than 2-cycles?
Theor. Comput. Sci., 2018

A 2-approximation algorithm for the contig-based genomic scaffold filling problem.
J. Bioinform. Comput. Biol., 2018

Predicting Model and Algorithm in RNA Folding Structure Including Pseudoknots.
Int. J. Pattern Recognit. Artif. Intell., 2018

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

Improved Indel Detection Algorithm Based on Split-Read and Read-Depth.
Proceedings of the Intelligent Computing Methodologies - 14th International Conference, 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
Approximating Max NAE-k-SAT by anonymous local search.
Theor. Comput. Sci., 2017

Improved algorithms for intermediate dataset storage in a cloud-based dataflow.
Theor. Comput. Sci., 2017

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

A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling.
Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

A New Approximation Algorithm for the Maximum Stacking Base Pairs Problem from RNA Secondary Structures Prediction.
Proceedings of the Combinatorial Optimization and Applications, 2017

A spectrum graph-based protein sequence filtering algorithm for proteoform identification by top-down mass spectrometry.
Proceedings of the 2017 IEEE International Conference on Bioinformatics and Biomedicine, 2017

2016
A 1.5-Approximation Algorithm for Two-Sided Scaffold Filling.
Algorithmica, 2016

A New Approximation Algorithm for Unsigned Translocation Sorting.
Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

Genomic Scaffold Filling Revisited.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

Mining structural variants of Heduo12 using paired-end reads.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2016

2015
A factor-(1.408 + ε) approximation for sorting unsigned genomes by reciprocal translocations.
Theor. Comput. Sci., 2015

A Dynamic Programming Algorithm For (1, 2)-Exemplar Breakpoint Distance.
J. Comput. Biol., 2015

Isomorphism and similarity for 2-generation pedigrees.
BMC Bioinform., 2015

Local Search to Approximate Max NAE- k k -Sat Tightly.
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow.
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Predicting Algorithm of RNA Folding Structure with Pseudoknots.
Proceedings of the 11th International Conference on Computational Intelligence and Security, 2015

2014
Predicting scheme of RNA folding structure including pseudoknots.
Int. J. Sens. Networks, 2014

A 4/3-approximation algorithm for finding a spanning tree to maximize its internal vertices.
CoRR, 2014

Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

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

A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations.
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

A parameterized algorithm for (1, 2)-exemplar breakpoint distance.
Proceedings of the 2014 IEEE International Conference on Bioinformatics and Biomedicine, 2014

2013
Sorting genomes by generalized translocations.
Theor. Comput. Sci., 2013

Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems.
Theor. Comput. Sci., 2013

An Exact Algorithm for the Zero Exemplar Breakpoint Distance Problem.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013

An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013

New Heuristic Algorithm of RNA Structure Prediction Including Pseudoknots.
J. Comput., 2013

Implementing program extraction from CL1-proofs.
CoRR, 2013

Complexity and Approximation Results for the Min-Sum and Min-Max Disjoint Paths Problems.
Comput. Informatics, 2013

The Algorithm for the Two-Sided Scaffold Filling Problem.
Proceedings of the Theory and Applications of Models of Computation, 2013

An Approximation Scheme for RNA Folding Structure Prediction Including Pseudoknots.
Proceedings of the Ninth International Conference on Computational Intelligence and Security, 2013

A Dynamic Programming Algorithm for Unsigned (1, 2)-Exemplar Breakpoint Distance Problem with Span Constraint.
Proceedings of the Sixth International Conference on Business Intelligence and Financial Engineering, 2013

The Duplication-Loss Problem: Novel Algorithms Based on k-NNI Local Search.
Proceedings of the Sixth International Conference on Business Intelligence and Financial Engineering, 2013

2012
A (1+ε)-approximation algorithm for sorting by short block-moves.
Theor. Comput. Sci., 2012

A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations.
J. Comput. Syst. Sci., 2012

Minimum common string partition revisited.
J. Comb. Optim., 2012

An approximation algorithm for the Generalized k-Multicut problem.
Discret. Appl. Math., 2012

On the toggling-branching recurrence of Computability Logic
CoRR, 2012

Protein-protein binding site identification by enumerating the configurations.
BMC Bioinform., 2012

De Novo Peptide Sequencing Based on Vertex Contraction Algorithm.
Proceedings of the Fifth International Joint Conference on Computational Sciences and Optimization, 2012

On Editing Graphs into 2-Club Clusters.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011
Analysis of the Hamming Weight of the Extended wmbNAF.
IACR Cryptol. ePrint Arch., 2011

A 14/11-approximation algorithm for sorting by short block-moves.
Sci. China Inf. Sci., 2011

Algorithms for sorting unsigned linear genomes by the DCJ operations.
Bioinform., 2011

Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

New Heuristic Algorithm of RNA Secondary Structure Prediction with Pseudoknots.
Proceedings of the Seventh International Conference on Computational Intelligence and Security, 2011

2010
A predicting algorithm of RNA secondary structure based on stems.
Kybernetes, 2010

Parameterized complexity of control problems in Maximin election.
Inf. Process. Lett., 2010

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

Polynomial-Time Algorithm for Sorting by Generalized Translocations.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

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

A Bicriteria Approximation Algorithm for Generalized k-Multicut in Trees.
Proceedings of the Second International Joint Conference on Computational Sciences and Optimization, 2009

A (1+e)-Approximation Algorithm for Sorting by Short Block-Moves.
Proceedings of the Second International Joint Conference on Computational Sciences and Optimization, 2009

Translocation-Deletions Distance Formula for Sorting Genomes.
Proceedings of the CSIE 2009, 2009 WRI World Congress on Computer Science and Information Engineering, March 31, 2009

2008
DNA Encoding Methods in the Field of DNA Computing.
Proceedings of the Computational Intelligence in Bioinformatics, 2008

A (1.5 + epsilon)-Approximation Algorithm for Unsigned Translocation Distance.
IEEE ACM Trans. Comput. Biol. Bioinform., 2008

On Constrained Facility Location Problems.
J. Comput. Sci. Technol., 2008

DNA solution based on sequence alignment to the Minimum Spanning Tree problem.
Int. J. Bioinform. Res. Appl., 2008

A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem.
Discret. Math., 2008

Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) Singletons.
Proceedings of the Theory and Applications of Models of Computation, 2008

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

A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
Faster algorithms for sorting by transpositions and sorting by block interchanges.
ACM Trans. Algorithms, 2007

A 1.75-approximation algorithm for unsigned translocation distance.
J. Comput. Syst. Sci., 2007

Algorithms for the Well-Drilling Layout Problem.
Proceedings of the Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 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

2006
On the complexity of unsigned translocation distance.
Theor. Comput. Sci., 2006

DNA Computing Model for the Minimum Spanning Tree Problem.
Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2006), 2006

Complexity Analysis for the HEWN Algorithm.
Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications (ISDA 2006), 2006

A New DNA Encoding Method for Traveling Salesman Problem.
Proceedings of the Computational Intelligence and Bioinformatics, 2006

A New DNA-Based Approach to Solve the Maximum Weight Clique Problem.
Proceedings of the Computational Intelligence and Bioinformatics, 2006

DNA Encoding Method of Weight for Chinese Postman Problem.
Proceedings of the IEEE International Conference on Evolutionary Computation, 2006

2005
An <i>O</i>(<i>n</i><sup>2</sup>) algorithm for signed translocation.
J. Comput. Syst. Sci., 2005

A New Pseudoknots Folding Algorithm for RNA Structure Prediction.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

An O(N<sup>2</sup>) algorithm for signed translocation problem.
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

2004
CTRD: a fast applet for computing signed translocation distance between genomes.
Bioinform., 2004

2001
Hardness and Methods to Solve CLIQUE.
J. Comput. Sci. Technol., 2001

1994
Analysis of the Convergency of Topology Preserving Neural Networks on Learning.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994


  Loading...