Chuan Yi Tang

According to our database1, Chuan Yi Tang authored at least 151 papers between 1984 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
An image authentication and recovery scheme based on turtle Shell algorithm and AMBTC-compression.
Multim. Tools Appl., November, 2022

2020
Clover: a clustering-oriented de novo assembler for Illumina sequences.
BMC Bioinform., 2020

2019
MetaSMC: a coalescent-based shotgun sequence simulator for evolving microbial populations.
Bioinform., 2019

Optimization of GPU Memory Usage for Training Deep Neural Networks.
Proceedings of the Pervasive Systems, Algorithms and Networks, 2019

A Review of Deep Learning in Computer-Aided Drug Design.
Proceedings of the 2019 IEEE International Conference on Bioinformatics and Biomedicine, 2019

2018
Performance of Convolution Neural Network based on Multiple GPUs with Different Data Communication Models.
Proceedings of the 19th IEEE/ACIS International Conference on Software Engineering, 2018

Chronic Kidney Disease Survival Prediction with Artificial Neural Networks.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2018

Using Deep Learning to Identify Cell and Particle in Live-Cell Time-lapse Images.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2018

Optimum Communication Spanning Trees.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Bioinformatics tools with deep learning based on GPU.
Proceedings of the 2017 IEEE International Conference on Bioinformatics and Biomedicine, 2017

2016
A simple algorithm for identifying integrons and gene cassettes in bacteria on next generation sequencing data.
Int. J. Data Min. Bioinform., 2016

2015
Guest Editorial for the 25th International Conference on Genome Informatics (GIW/ISCB-Asia 2014).
IEEE ACM Trans. Comput. Biol. Bioinform., 2015

Cloud computing service framework for bioinformatics tools.
Proceedings of the 2015 IEEE International Conference on Bioinformatics and Biomedicine, 2015

2014
Editorial.
J. Bioinform. Comput. Biol., 2014

Development of 3D-QSAR combination approach for discovering and analysing neuraminidase inhibitors in silico.
Int. J. Data Min. Bioinform., 2014

Drug resistance gene identification algorithm for next-generation sequencing data.
Proceedings of the 2014 IEEE International Conference on Bioinformatics and Biomedicine, 2014

2013
Comparing System Selection Methods for the Combinatorial Fusion of Multiple Retrieval Systems.
J. Interconnect. Networks, 2013

Reconstruction of phyletic trees by global alignment of multiple metabolic networks.
BMC Bioinform., 2013

2012
Design of Novel FLT-3 Inhibitors Based on Dual-Layer 3D-QSAR Model and Fragment-Based Compounds <i>in Silico</i>.
J. Chem. Inf. Model., 2012

Parallel Shellsort Algorithm for Many-Core GPUs with CUDA.
Int. J. Grid High Perform. Comput., 2012

Simpute: A Simple Genotype Imputation Method.
Proceedings of the Sixth International Conference on Complex, 2012

2011
Development of Novel 3D-QSAR Combination Approach for Screening and Optimizing B-Raf Inhibitors in silico.
J. Chem. Inf. Model., 2011

Multiple genome sequences alignment algorithm based on coding regions.
Int. J. Comput. Biol. Drug Des., 2011

A genetic algorithm-based boolean delay model of intracellular signal transduction in inflammation.
BMC Bioinform., 2011

A novel method to identify cooperative functional modules: study of module coordination in the <i>Saccharomyces cerevisiae </i>cell cycle.
BMC Bioinform., 2011

CUDA-FRESCO: Frequency-Based RE-Sequencing Tool Based on CO-clustering Segmentation by GPU.
Proceedings of the 13th IEEE International Conference on High Performance Computing & Communication, 2011

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

On the bottleneck tree alignment problems.
Inf. Sci., 2010

An improved algorithm for sorting by block-interchanges based on permutation groups.
Inf. Process. Lett., 2010

Computational modeling with forward and reverse engineering links signaling network and genomic regulatory responses: NF-kappaB signaling-induced gene expression responses in inflammation.
BMC Bioinform., 2010

A parallel and incremental algorithm for efficient unique signature discovery on DNA databases.
BMC Bioinform., 2010

Feature-incorporated alignment based ligand-binding residue prediction for carbohydrate-binding modules.
Bioinform., 2010

An incremental algorithm for efficient unique signature discoveries on DNA databases.
Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

Balanced Multi-process Parallel Algorithm for Chemical Compound Inference with Given Path Frequencies.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2010

Develop integration modeling approach for discovery neuraminidase inhibitors in silico based on pharmacophore and CoMSIA models.
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2010

A re-sequencing tool for high mismatch-tolerant short read alignment based on Burrows-Wheeler Transform.
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2010

CORAL-M: Heuristic coding region alignment method for multiple genome sequences.
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2010

2009
Efficient parallel branch-and-bound algorithm for constructing minimum ultrametric trees.
J. Parallel Distributed Comput., 2009

Chemical Compounds with Path Frequency Using Multi-Core Technology.
Proceedings of the Scalable Information Systems, 4th International ICST Conference, 2009

A Parallel Algorithm for Three-Profile Alignment Method.
Proceedings of the International Joint Conferences on Bioinformatics, 2009

CAPS Genomic Subtyping on <i>Orthomyxoviridae</i>.
Proceedings of the Emerging Intelligent Computing Technology and Applications, 2009

Parallel branch-and-bound approach with MPI technology in inferring chemical compounds with path frequency.
Proceedings of the 2009 IEEE International Conference on Granular Computing, 2009

Biological Feature Incorporated Alignment for Cross Species Analysis on Carbohydrate Binding Modules.
Proceedings of the 2009 IEEE International Conference on Bioinformatics and Biomedicine, 2009

2008
An improved algorithm for finding a length-constrained maximum-density subtree in a tree.
Inf. Process. Lett., 2008

Extracting Alternative Splicing Information from Captions and Abstracts Using Natural Language Processing.
Proceedings of the IEEE International Conference on Sensor Networks, 2008

On the Relationships Among Various Diversity Measures in Multiple Classifier Systems.
Proceedings of the 9th International Symposium on Parallel Architectures, 2008

Probe Selection with Fault Tolerance.
Proceedings of the Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues, 2008

Introducing Variable Gap Penalties into Three-Sequence Alignment for Protein Sequences.
Proceedings of the 22nd International Conference on Advanced Information Networking and Applications, 2008

2007
Optimum Communication Spanning Trees.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

RE-MuSiC: a tool for multiple sequence alignment with regular expression constraints.
Nucleic Acids Res., 2007

Towards design of a nailfold capillary microscopy image analysis and diagnosis framework using grid technology.
J. High Speed Networks, 2007

Efficient algorithms for regular expression constrained sequence alignment.
Inf. Process. Lett., 2007

Constrained sequence alignment: A general model and the hardness results.
Discret. Appl. Math., 2007

3-Points Relationship Based Parallel Algorithm for Minimum Ultrametric Tree Construction.
Proceedings of the Parallel Computing Technologies, 2007

On the Diversity-Performance Relationship for Majority Voting in Classifier Ensembles.
Proceedings of the Multiple Classifier Systems, 7th International Workshop, 2007

Efficient Parallel Algorithm for Optimal Three-Sequences Alignment.
Proceedings of the 2007 International Conference on Parallel Processing (ICPP 2007), 2007

Approximation Algorithms for 2-Source Minimum Routing Cost <i>k</i> -Tree Problems.
Proceedings of the Computational Science and Its Applications, 2007

2006
Approximation algorithms for some <i>k</i>-source shortest paths spanning tree problems.
Networks, 2006

SPRING: a tool for the analysis of genome rearrangement using reversals and block-interchanges.
Nucleic Acids Res., 2006

GeneAlign: a coding exon prediction tool based on phylogenetical comparisons.
Nucleic Acids Res., 2006

A Near-Quadratic Algorithm for the Alpha-Connected Two-Center Problem.
J. Inf. Sci. Eng., 2006

Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs.
Inf. Process. Lett., 2006

A reinforced merging methodology for mapping unique peptide motifs in members of protein families.
BMC Bioinform., 2006

Exposing Phylogenetic Relationships by Genome Rearrangement.
Adv. Comput., 2006

BioPortal: A Portal for Deployment of Bioinformatics Applications on Cluster and Grid Environments.
Proceedings of the High Performance Computing for Computational Science, 2006

Comparative Gene Prediction Based on Gene Structure Conservation.
Proceedings of the Pattern Recognition in Bioinformatics, International Workshop, 2006

An Efficient Parallel Algorithm for Ultrametric Tree Construction Based on 3PR.
Proceedings of the Frontiers of High Performance Computing and Networking, 2006

2005
An Efficient Algorithm for Sorting by Block-Interchanges and Its Application to the Evolution of Vibrio Species.
J. Comput. Biol., 2005

An improved algorithm for the maximum agreement subtree problem.
Inf. Process. Lett., 2005

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

EXONSCAN: EXON prediction with Signal detection and Coding region AligNment in homologous sequences.
Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

A Fast Technique for Constructing Evolutionary Tree with the Application of Compact Sets.
Proceedings of the Parallel Computing Technologies, 2005

Comparative Exon Prediction based on Heuristic Coding Region Alignment.
Proceedings of the 8th International Symposium on Parallel Architectures, 2005

Disjoint Segments with Maximum Density.
Proceedings of the Computational Science, 2005

Feature Selection and Combination Criteria for Improving Predictive Accuracy in Protein Structure Classification.
Proceedings of the Fifth IEEE International Symposium on Bioinformatic and Bioengineering (BIBE 2005), 2005

2004
Numerical Performance and Throughput Benchmark for Electronic Structure Calculations in PC-Linux Systems with New Architectures, Updated Compilers, and Libraries.
J. Chem. Inf. Model., 2004

A seriate coverage filtration approach for homology search.
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

Modeling Signal Transduction of Neural System by Hybrid Petri Net Representation.
Proceedings of the Operations Research, 2004

The Development of RFID in Healthcare in Taiwan.
Proceedings of the Fourth International Conference on Electronic Business, 2004

Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems.
Proceedings of the Computational Science and Its Applications, 2004

A Efficient Algorithm for Unique Signature Discovery on Whole-Genome EST Databases.
Proceedings of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004

An IDC-based Algorithm for Efficient Homology Filtration with Guaranteed Seriate Coverage.
Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004

An Improved Algorithm for the Maximum Agreement Subtree Problem.
Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004

2003
The full Steiner tree problem.
Theor. Comput. Sci., 2003

Efficient minus and signed domination in graphs.
Theor. Comput. Sci., 2003

Constrained Multiple Sequence Alignment Tool Development Andits Application to Rnase Family Alignment.
J. Bioinform. Comput. Biol., 2003

A fast algorithm for the alpha-connected two-center decision problem.
Inf. Process. Lett., 2003

Identify Amino Acid Candidates Critical for Function of Rat Imidase by Cross-reference Voting in Imidase SuperFamily.
Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003

On the Full and Bottleneck Full Steiner Tree Problems.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002
Light graphs with small routing cost.
Networks, 2002

Weighted efficient domination problem on some perfect graphs.
Discret. Appl. Math., 2002

Perfect edge domination and efficient edge domination in graphs.
Discret. Appl. Math., 2002

Constrained Multiple Sequence Alignment Tool Development and Its Application to RNase Family Alignment.
Proceedings of the 1st IEEE Computer Society Bioinformatics Conference, 2002

The Full Steiner Tree Problem in Phylogeny.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

A near-quadratic algorithm for the alpha-connected two-center decision problem.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Finding the shortest boundary guard of a simple polygon.
Theor. Comput. Sci., 2001

An optimal external selection algorithm and its application in the Internet.
Proceedings of the IEEE International Conference on Communications, 2001

A New Measure of Edit Distance between Labeled Trees.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
Edge and node searching problems on trees.
Theor. Comput. Sci., 2000

A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees.
J. Algorithms, 2000

Guarding in a simple polygon.
Inf. Process. Lett., 2000

An efficient external sorting algorithm.
Inf. Process. Lett., 2000

Embedding cycles and meshes onto incomplete hypercubes.
Int. J. Comput. Math., 2000

Approximation algorithms for some optimum communication spanning tree problems.
Discret. Appl. Math., 2000

Approximation algorithms for the shortest total path length spanning tree problem.
Discret. Appl. Math., 2000

Graph Searching on Some Subclasses of Chordal Graphs.
Algorithmica, 2000

Memory test time reduction by interconnecting test items.
Proceedings of the 9th Asian Test Symposium (ATS 2000), 4-6 December 2000, Taipei, Taiwan, 2000

1999
Automatic Test Timing Assignment for RAMs Using Linear Programming.
VLSI Design, 1999

A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees.
SIAM J. Comput., 1999

Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices.
J. Comb. Optim., 1999

An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree.
Inf. Process. Lett., 1999

Constructing Light Spanning Trees with Small Routing Cost.
Proceedings of the STACS 99, 1999

1998
Efficient Emulations for X-trees and /w-ary Trees.
Parallel Algorithms Appl., 1998

Solving the Weighted Efficient Edge Domination Problem on Bipartite Permutation Graphs.
Discret. Appl. Math., 1998

Synchronizable test sequence for multi-party protocol conformance testing.
Comput. Commun., 1998

A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

An Average Case Analysis of the Branching Algorithm for Solving $k$-Satisfiability Problems.
Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1997
An O(n) Algorithm for Finding an Optimal Position with Relative Distances in an Evolutionary Tree.
Inf. Process. Lett., 1997

A Linear-Time Algorithm for the Weighted Feedback Vertex Problem on Interval Graphs.
Inf. Process. Lett., 1997

Effincient Domination of Permutation Graphs and Trapezoid Graphs.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
Graph Searching on Chordal Graphs.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Profiling Dependence Vectors for Loop Parallelization.
Proceedings of IPPS '96, 1996

1995
Randomized algorithms for the on-line minimum matching problem on euclidean space.
Int. J. Comput. Math., 1995

Improving the UIOv-method for protocol conformance testing.
Comput. Commun., 1995

The emulation problem on trees.
Proceedings of IPPS '95, 1995

1994
Single Step Searching in Weighted Block Graphs.
Inf. Sci., 1994

Average Performance of a Greedy Algorithm for the On-Line Minimum Matching Problem on Euclidean Space.
Inf. Process. Lett., 1994

Fast Algorithms for Simulating the CRCW Shared-Memory Computer on Reconfigurable Meshes.
Proceedings of the 1994 International Conference on Parallel Processing, 1994

An Efficient Emulation for Tree-Connected Networks.
Proceedings of the Proceedings 1994 International Conference on Parallel and Distributed Systems, 1994

1993
A Different Approach for Solving the Specified Diameter Partition Problem.
J. Inf. Sci. Eng., 1993

The summation and bottleneck minimization for single-step searching on weighted graphs.
Inf. Sci., 1993

The Competitiveness of Randomized Algorithms for On-Line Steiner Tree and On-Line Spanning Tree Problems.
Inf. Process. Lett., 1993

A 2.|E|-Bit Distributed Algorithm for the Directed Euler Trail Problem.
Inf. Process. Lett., 1993

Minimum-Cost Synchronizable Test Sequence Generation via the DuplexU Digraph.
Proceedings of the Proceedings IEEE INFOCOM '93, The Conference on Computer Communications, Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies, Networking: Foundation for the Future, San Francisco, CA, USA, March 28, 1993

A New Loop Partition Method-Clustering.
Proceedings of the IFIP WG10.3. Working Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism, 1993

1992
Using Conflicts to Derive Efficient Algorithms on the Single-Channel Broadcast Communication Model.
J. Inf. Sci. Eng., 1992

Tightly-Synchronizable Protocol Test Generation Via the Duplex Technique.
J. Inf. Sci. Eng., 1992

An Efficient Algorithm for Finding a Maximum Weight 2-Independent Set on Interval Graphs.
Inf. Process. Lett., 1992

Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs.
Discret. Appl. Math., 1992

An Average Case Analysis of a Resolution Principle Algorithm in Mechanical Theorem Proving.
Ann. Math. Artif. Intell., 1992

Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood Graphs.
Algorithmica, 1992

1991
20-relative neighborhood graphs are hamiltonian.
J. Graph Theory, 1991

Solving the Single Step Graph Searching Problem by Solving the Maximum Two-Independent Set Problem.
Inf. Process. Lett., 1991

Computing the Optimal IO Sequences of a Protocol in Polynomial Time.
Inf. Process. Lett., 1991

Covering convex rectilinear polygons in linear time.
Int. J. Comput. Geom. Appl., 1991

An Average Case Analysis of Monien and Speckenmeyer's Mechanical Theorem Proving Algorithm.
Proceedings of the ISA '91 Algorithms, 1991

Ranking Unranking and Parallel Enumerating of Topological Orders.
Proceedings of the International Conference on Parallel Processing, 1991

A unified approach for solving bottleneck k-bipartition problems.
Proceedings of the 19th annual conference on Computer Science, 1991

1990
An Optimal Algorithm for Constructing Oriented Voronoi Diagrams and Geographic Neighborhood Graphs.
Inf. Process. Lett., 1990

1985
On the complexity of some multi-attribute file design problems.
Inf. Syst., 1985

1984
Optimal speeding up of parallel algorithms based upon the divide-and-conquer strategy.
Inf. Sci., 1984


  Loading...