Author of the publication

Algorithms and Hardness for Scaffold Filling to Maximize Increased Duo-Preservations.

, , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 19 (4): 2071-2079 (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Algorithms for sorting unsigned linear genomes by the DCJ operations., , and . Bioinform., 27 (3): 311-316 (2011)Optimization of the Active disturbance rejection control of a Four-Rotor Aircraft., , , and . Mechatron. Syst. Control., (2020)An Approximation Algorithm for Sorting by Bounded Singleton Moves., , , , and . COCOON, volume 11653 of Lecture Notes in Computer Science, page 580-590. Springer, (2019)On the solution bound of two-sided scaffold filling., , , and . Theor. Comput. Sci., (2021)Large Language Model for Causal Decision Making., , , , and . CoRR, (2023)Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear Linear Programming-Rounding., , , , and . J. Comput. Biol., 27 (2): 200-211 (2020)CoAtGIN: Marrying Convolution and Attention for Graph-based Molecule Property Prediction., , , , , and . BIBM, page 374-379. IEEE, (2022)The Longest Common Exemplar Subsequence Problem., , , , , , and . BIBM, page 92-95. IEEE Computer Society, (2018)Improved Approximation Algorithms for Sorting Unsigned Genomes by Reversals., , and . BIBM, page 36-42. IEEE, (2023)Minimize Maximum Coverage of Fragment Alignment Selection., , , and . BIBM, page 349-354. IEEE, (2023)