Chin Lung Lu

Nucleic Acids Res., 2022

An Integer Linear Programming Approach for Scaffolding Based on Exemplar Breakpoint Distance.

[BibT_eX]

[DOI]

J. Comput. Biol., 2022

2021

Computing a longest common almost-increasing subsequence of two sequences.

[BibT_eX]

[DOI]

Toan Thang Ta

Yi-Kung Shieh

Theor. Comput. Sci., 2021

The exact multiple pattern matching problem solved by a reference tree approach.

[BibT_eX]

[DOI]

Yi-Kung Shieh

Shyong Jian Shyu

Theor. Comput. Sci., 2021

2020

Clover: a clustering-oriented de novo assembler for Illumina sequences.

[BibT_eX]

[DOI]

Ming-Feng Hsieh

BMC Bioinform., 2020

2018

CSAR-web: a web server of contig scaffolding using algebraic rearrangements.

[BibT_eX]

[DOI]

Kun-Tze Chen

Nucleic Acids Res., 2018

Two-string consensus problem under non-overlapping inversion and transposition distance.

[BibT_eX]

[DOI]

Toan Thang Ta

Cheng-Yao Lin

Inf. Process. Lett., 2018

CSAR: a contig scaffolding tool using algebraic rearrangements.

[BibT_eX]

[DOI]

Bioinform., 2018

2017

R3D-BLAST2: an improved search tool for similar RNA 3D substructures.

[BibT_eX]

[DOI]

BMC Bioinform., 2017

2016

Sorting by Transpositions and Reversals (Approximate Ratio 1.5).

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

An efficient algorithm for one-sided block ordering problem under block-interchange distance.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

iPARTS2: an improved tool for pairwise alignment of RNA tertiary structures, version 2.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2016

An efficient algorithm for computing non-overlapping inversion and transposition distance.

[BibT_eX]

[DOI]

Toan Thang Ta

Cheng-Yao Lin

Inf. Process. Lett., 2016

Multi-CAR: a tool of contig scaffolding using multiple references.

[BibT_eX]

[DOI]

BMC Bioinform., 2016

2015

An Efficient Algorithm for the Contig Ordering Problem under Algebraic Rearrangement Distance.

[BibT_eX]

[DOI]

J. Comput. Biol., 2015

A Systematical and Parallel Approach to Solve Problems Involving Special Properties of Bit-Vectors.

[BibT_eX]

[DOI]

Chia Shin Ou

Richard C. T. Lee

Comput. J., 2015

2014

CAR: contig assembly of prokaryotic draft genomes using rearrangements.

[BibT_eX]

[DOI]

BMC Bioinform., 2014

Approximate String Matching Problem under Non-Overlapping Inversion Distance.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Systems and Applications, 2014

Prefix Block-Interchanges on Binary Strings.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Systems and Applications, 2014

2013

A new filtration method and a hybrid strategy for approximate string matching.

[BibT_eX]

[DOI]

Chia Wei Lu

Richard C. T. Lee

Theor. Comput. Sci., 2013

Assembling contigs in draft genomes using reversals and block-interchanges.

[BibT_eX]

[DOI]

Chi-Long Li

Kun-Tze Chen

BMC Bioinform., 2013

An Efficient Algorithm for One-Sided Block Ordering Problem with Block-Interchange Distance.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2011

R3D-BLAST: a search tool for similar RNA 3D substructures.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2011

2010

iPARTS: an improved tool of pairwise alignment of RNA tertiary structures.

[BibT_eX]

[DOI]

Chih-Wei Wang

Kun-Tze Chen

Nucleic Acids Res., 2010

SoRT<sup>2</sup>: a tool for sorting genomes and reconstructing phylogenetic trees by reversals, generalized transpositions and translocations.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2010

Sorting by Reversals, Generalized Transpositions, and Translocations Using Permutation Groups.

[BibT_eX]

[DOI]

Yen-Lin Huang

J. Comput. Biol., 2010

An improved algorithm for sorting by block-interchanges based on permutation groups.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Reconstructing genome trees of prokaryotes using overlapping genes.

[BibT_eX]

[DOI]

BMC Bioinform., 2010

2009

FASTR3D: a fast and accurate search tool for similar RNA 3D structures.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2009

2008

Sorting by Transpositions and Reversals (Approximate Ratio 1.5).

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

OGtree: a tool for creating genome trees of prokaryotes based on overlapping genes.

[BibT_eX]

[DOI]

Li-Wei Jiang

Kuang-Lun Lin

Nucleic Acids Res., 2008

SARSA: a web tool for structural alignment of RNA using a structural alphabet.

[BibT_eX]

[DOI]

Yen-Fu Chang

Yen-Lin Huang

Nucleic Acids Res., 2008

An improved algorithm for finding a length-constrained maximum-density subtree in a tree.

[BibT_eX]

[DOI]

Hsin-Hao Su

Inf. Process. Lett., 2008

2007

RE-MuSiC: a tool for multiple sequence alignment with regular expression constraints.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2007

Efficient algorithms for regular expression constrained sequence alignment.

[BibT_eX]

[DOI]

Yun Sheng Chung

Inf. Process. Lett., 2007

Constrained sequence alignment: A general model and the hardness results.

[BibT_eX]

[DOI]

Yun Sheng Chung

Discret. Appl. Math., 2007

2006

SPRING: a tool for the analysis of genome rearrangement using reversals and block-interchanges.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2006

Analysis of circular genome rearrangement by fusions, fissions and block-interchanges.

[BibT_eX]

[DOI]

BMC Bioinform., 2006

2005

The approximability of the weighted Hamiltonian path completion problem on a tree.

[BibT_eX]

[DOI]

Quincy Wu

Theor. Comput. Sci., 2005

An Efficient Algorithm for Sorting by Block-Interchanges and Its Application to the Evolution of Vibrio Species.

[BibT_eX]

[DOI]

J. Comput. Biol., 2005

ROBIN: a tool for genome rearrangement of block-interchanges.

[BibT_eX]

[DOI]

Bioinform., 2005

A memory-efficient algorithm for multiple sequence alignment with constraints.

[BibT_eX]

[DOI]

Yen Pin Huang

Bioinform., 2005

A heuristic approach for detecting RNA H-type pseudoknots.

[BibT_eX]

[DOI]

Chun-Hsiang Huang

Hsien-Tai Chiu

Bioinform., 2005

2004

MuSiC: a tool for multiple sequence alignment with constraints.

[BibT_eX]

[DOI]

Bioinform., 2004

2003

The full Steiner tree problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Efficient minus and signed domination in graphs.

[BibT_eX]

[DOI]

Sheng-Lung Peng

Theor. Comput. Sci., 2003

Constrained Multiple Sequence Alignment Tool Development Andits Application to Rnase Family Alignment.

[BibT_eX]

[DOI]

Margaret Dah-Tsyr Chang

J. Bioinform. Comput. Biol., 2003

On the Full and Bottleneck Full Steiner Tree Problems.

[BibT_eX]

[DOI]

Yen Hung Chen

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

Weighted efficient domination problem on some perfect graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Perfect edge domination and efficient edge domination in graphs.

[BibT_eX]

[DOI]

Ming-Tat Ko

Discret. Appl. Math., 2002

Constrained Multiple Sequence Alignment Tool Development and Its Application to RNase Family Alignment.

[BibT_eX]

[DOI]

Margaret Dah-Tsyr Chang

Proceedings of the 1st IEEE Computer Society Bioinformatics Conference, 2002

The Full Steiner Tree Problem in Phylogeny.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

A New Measure of Edit Distance between Labeled Trees.

[BibT_eX]

[DOI]

Zheng-Yao Su

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree.

[BibT_eX]

[DOI]

Q. S. Wu

Richard C. T. Lee

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1998

Solving the Weighted Efficient Edge Domination Problem on Bipartite Permutation Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

1997

A Linear-Time Algorithm for the Weighted Feedback Vertex Problem on Interval Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Effincient Domination of Permutation Graphs and Trapezoid Graphs.

[BibT_eX]

[DOI]

Y. Daniel Liang