H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 36 Citations 9,209 160 World Ranking 5528 National Ranking 523

Research.com Recognitions

Awards & Achievements

1996 - IEEE Fellow For contributions to developments in parallel and distributed computing and to computer science education.

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Artificial intelligence
  • Gene

Francis Y. L. Chin mostly deals with Algorithm, Combinatorics, Scheduling, Genome and Metagenomics. His Algorithm research incorporates elements of Discrete mathematics, Base sequence and Theoretical computer science. His work on Time complexity, Graph theory and Packing problems as part of general Combinatorics study is frequently linked to SIMPLE algorithm, bridging the gap between disciplines.

His Scheduling study integrates concerns from other disciplines, such as Upper and lower bounds, Competitive analysis and Theory of computation. In his research on the topic of Genome, Sequence assembly and Reference genome is strongly related with De Bruijn graph. His Metagenomics research is multidisciplinary, relying on both Data mining, Contig and Cluster analysis.

His most cited work include:

  • IDBA-UD (1704 citations)
  • Improved on-line broadcast scheduling with deadlines (665 citations)
  • Meta-IDBA (252 citations)

What are the main themes of his work throughout his whole career to date?

Francis Y. L. Chin mainly focuses on Combinatorics, Algorithm, Competitive analysis, Online algorithm and Upper and lower bounds. The Combinatorics study combines topics in areas such as Discrete mathematics, Sequence and Bounded function. His work in the fields of Approximation algorithm overlaps with other areas such as Motif.

Francis Y. L. Chin interconnects Cellular network, Mathematical optimization, Combinatorial optimization and Scheduling, Job shop scheduling in the investigation of issues within Competitive analysis. His study in Online algorithm is interdisciplinary in nature, drawing from both Bin and Bin packing problem. His study connects Deterministic algorithm and Upper and lower bounds.

He most often published in these fields:

  • Combinatorics (30.80%)
  • Algorithm (28.40%)
  • Competitive analysis (16.40%)

What were the highlights of his more recent work (between 2012-2020)?

  • Algorithm (28.40%)
  • Combinatorics (30.80%)
  • Genetics (7.60%)

In recent papers he was focusing on the following fields of study:

Algorithm, Combinatorics, Genetics, Artificial intelligence and Sequence are his primary areas of study. His study in the field of Binary tree also crosses realms of Revenue. His research in Combinatorics intersects with topics in Bounded function and Online algorithm.

His Genetics study also includes fields such as

  • Sequence assembly which is related to area like De Bruijn graph and Reference genome,
  • Computational biology which is related to area like Metagenomics, Microbial genome and Time complexity. His biological study spans a wide range of topics, including Center, Upper and lower bounds, Star and Product. His work deals with themes such as Lineage and Microbiology, which intersect with Genome.

Between 2012 and 2020, his most popular works were:

  • IDBA-tran: a more robust de novo de Bruijn graph assembler for transcriptomes with uneven expression levels. (134 citations)
  • Cellular adhesiveness and cellulolytic capacity in Anaerolineae revealed by omics-based genome interpretation. (78 citations)
  • Cellular adhesiveness and cellulolytic capacity in Anaerolineae revealed by omics-based genome interpretation. (78 citations)

In his most recent research, the most cited papers focused on:

  • Artificial intelligence
  • Algorithm
  • Gene

Francis Y. L. Chin focuses on Genetics, Genome, Sequence assembly, Metagenomics and Genomics. His study in the fields of Contig and DNA sequencing under the domain of Genetics overlaps with other disciplines such as Thermophile. His Genome research is multidisciplinary, incorporating perspectives in Annotation and Artificial intelligence.

The study incorporates disciplines such as De Bruijn graph and Reference genome in addition to Sequence assembly. His De Bruijn graph study incorporates themes from Base, Bacterial genome size, Algorithm, Chromosome and Tandem repeat. Francis Y. L. Chin combines subjects such as Biomass, Biotechnology, Biorefinery, Carbohydrate metabolism and Phylogenetics with his study of Metagenomics.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

IDBA-UD

Yu Peng;Henry C. M. Leung;S. M. Yiu;Francis Y. L. Chin.
Bioinformatics (2012)

2730 Citations

Improved on-line broadcast scheduling with deadlines

Feifeng Zheng;Stanley P. Y. Fung;Wun-Tat Chan;Francis Y. L. Chin.
computing and combinatorics conference (2006)

667 Citations

Meta-IDBA

Yu Peng;Henry C. M. Leung;S. M. Yiu;Francis Y. L. Chin.
intelligent systems in molecular biology (2011)

382 Citations

IDBA: a practical iterative de bruijn graph de novo assembler

Yu Peng;Henry C. M. Leung;S. M. Yiu;Francis Y. L. Chin.
research in computational molecular biology (2010)

305 Citations

Efficient parallel algorithms for some graph problems

Francis Y. Chin;John Lam;I-Ngo Chen.
Communications of The ACM (1982)

276 Citations

Auditing and Inference Control in Statistical Databases

F.Y. Chin;G. Ozsoyoglu.
IEEE Transactions on Software Engineering (1982)

267 Citations

Predicting protein complexes from PPI data: a core-attachment approach.

Henry C. M. Leung;Qian Xiang;Siu-Ming Yiu;Francis Y. L. Chin.
Journal of Computational Biology (2009)

211 Citations

Packing squares into a square

Joseph Y.-T. Leung;Tommy W. Tam;C. S. Wong;Gilbert H. Young.
Journal of Parallel and Distributed Computing (1990)

204 Citations

APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR

W.S. Chan;F. Chin.
International Journal of Computational Geometry and Applications (1996)

186 Citations

Finding the Medial Axis of a Simple Polygon in Linear Time

Francis Y. L. Chin;Jack Snoeyink;Cao An Wang.
Discrete and Computational Geometry (1999)

161 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing Francis Y. L. Chin

Jillian F. Banfield

Jillian F. Banfield

University of California, Berkeley

Publications: 127

Brian C. Thomas

Brian C. Thomas

Metagenomi

Publications: 56

Alfried P. Vogler

Alfried P. Vogler

Imperial College London

Publications: 31

Konstantinos T. Konstantinidis

Konstantinos T. Konstantinidis

Georgia Institute of Technology

Publications: 30

Jianxin Wang

Jianxin Wang

Central South University

Publications: 29

Fang-Xiang Wu

Fang-Xiang Wu

University of Saskatchewan

Publications: 29

Brett J. Baker

Brett J. Baker

The University of Texas at Austin

Publications: 23

Simon Roux

Simon Roux

Lawrence Berkeley National Laboratory

Publications: 22

Francisco Rodriguez-Valera

Francisco Rodriguez-Valera

Miguel Hernandez University

Publications: 22

Tao Jiang

Tao Jiang

University of California, Riverside

Publications: 21

Marek Chrobak

Marek Chrobak

University of California, Riverside

Publications: 21

Jack A. Gilbert

Jack A. Gilbert

University of California, San Diego

Publications: 21

Pavel A. Pevzner

Pavel A. Pevzner

University of California, San Diego

Publications: 20

Min Li

Min Li

Central South University

Publications: 20

Tong Zhang

Tong Zhang

University of Hong Kong

Publications: 19

Something went wrong. Please try again later.