Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chen-Fu Liao

dblp:126/2683 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2016
0000-0002-6532-4183ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 67% Computational geometry · 33%
Artificial intelligence
1 paper
Motion planning and robot control · 87% Robot navigation and mapping · 13%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis › sequence assembly
genome assembly
0.212016
Integration of string and de Bruijn graphs for genome assembly · Bioinform. 2016
Bioinformatics and computational biology
genomics
0.212016
Integration of string and de Bruijn graphs for genome assembly · Bioinform. 2016
Graph algorithms and graph theory › directed graph
de bruijn graph
0.112016
Integration of string and de Bruijn graphs for genome assembly · Bioinform. 2016
Graph algorithms and graph theory
graph algorithms
0.112016
Integration of string and de Bruijn graphs for genome assembly · Bioinform. 2016
Computational geometry › intersection graphs
string graphs
0.112016
Integration of string and de Bruijn graphs for genome assembly · Bioinform. 2016
Robotics › Motion planning and robot control › robot control
impedance control
0.011997
Generalized impedance control of a redundant manipulator for handling tasks with position uncertainty while avoiding obstacles · ICRA 1997
Robotics › Motion planning and robot control › robot control
redundant manipulator control
0.011997
Generalized impedance control of a redundant manipulator for handling tasks with position uncertainty while avoiding obstacles · ICRA 1997
Robotics › Robot navigation and mapping
obstacle avoidance
0.011997
Generalized impedance control of a redundant manipulator for handling tasks with position uncertainty while avoiding obstacles · ICRA 1997

Methods — techniques the papers use, named apart from their topics

string graph · 0.5de bruijn graph · 0.5FM-index · 0.5redundancy resolution · 0.0generalized impedance control · 0.0
YearPublicationVenuePosition
2016 Integration of string and de Bruijn graphs for genome assembly
abstract
MOTIVATION: String and de Bruijn graphs are two graph models used by most genome assemblers. At present, none of the existing assemblers clearly outperforms the others across all datasets. We found that although a string graph can make use of entire reads for resolving repeats, de Bruijn graphs can naturally assemble through regions that are error-prone due to sequencing bias. RESULTS: We developed a novel assembler called StriDe that has advantages of both string and de Bruijn graphs. First, the reads are decomposed adaptively only in error-prone regions. Second, each paired-end read is extended into a long read directly using an FM-index. The decomposed and extended reads are used to build an assembly graph. In addition, several essential components of an assembler were designed or improved. The resulting assembler was fully parallelized, tested and compared with state-of-the-art assemblers using benchmark datasets. The results indicate that contiguity of StriDe is comparable with top assemblers on both short-read and long-read datasets, and the assembly accuracy is high in comparison with the others. AVAILABILITY AND IMPLEMENTATION: https://github.com/ythuang0522/StriDe CONTACT: : [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Yao-Ting Huang, Chen-Fu Liao
Bioinform.2
1997 Generalized impedance control of a redundant manipulator for handling tasks with position uncertainty while avoiding obstacles
abstract
Positioning uncertainty becomes a major problem for position-control-based robots when operating in contact with the environment. Inaccuracy in positioning parts or inadequate information about part placement has traditionally been addressed through accurate fixturing, calibration and robot programming. Impedance control provides a mechanism for using the reaction forces and torques at the end effector to compensate for positioning uncertainty. Redundant manipulators have greater manipulability than nonredundant manipulators thus facilitating the implementation of more complex tasks, and making it possible to also avoid collisions by taking advantage of the redundancies. Handling positioning uncertainty while simultaneously avoiding collisions are solved by using the generalized impedance control algorithm developed in this study. This was successfully demonstrated on the 7 degree-of-freedom redundant Robotics Research Corporation K1207i manipulator.
Chen-Fu Liao, Max Donath
ICRA1