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

Yi-Kung Shieh

dblp:211/6429 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2021
—ORCID · none

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

Theory of computation · 2 · 1 first-author · 2 since 2021Applied, 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%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis › sequence assembly
genome assembly
0.312018
CSAR: a contig scaffolding tool using algebraic rearrangements · Bioinform. 2018
Bioinformatics and computational biology › sequence analysis › sequence assembly › genome assembly
scaffolding
0.312018
CSAR: a contig scaffolding tool using algebraic rearrangements · Bioinform. 2018

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

algebraic rearrangement · 0.3
YearPublicationVenuePosition
2021 The exact multiple pattern matching problem solved by a reference tree approach
Yi-Kung Shieh, Shyong Jian Shyu, Chin Lung Lu, Richard C. T. Lee
Theor. Comput. Sci.1
2021 Computing a longest common almost-increasing subsequence of two sequences
Toan Thang Ta, Yi-Kung Shieh, Chin Lung Lu
Theor. Comput. Sci.2
2018 CSAR: a contig scaffolding tool using algebraic rearrangements
abstract
Summary: Advances in next generation sequencing have generated massive amounts of short reads. However, assembling genome sequences from short reads still remains a challenging task. Due to errors in reads and large repeats in the genome, many of current assembly tools usually produce just collections of contigs whose relative positions and orientations along the genome being sequenced are still unknown. To address this issue, a scaffolding process to order and orient the contigs of a draft genome is needed for completing the genome sequence. In this work, we propose a new scaffolding tool called CSAR that can efficiently and more accurately order and orient the contigs of a given draft genome based on a reference genome of a related organism. In particular, the reference genome required by CSAR is not necessary to be complete in sequence. Our experimental results on real datasets have shown that CSAR outperforms other similar tools such as Projector2, OSLay and Mauve Aligner in terms of average sensitivity, precision, F-score, genome coverage, NGA50 and running time. Availability and implementation: The program of CSAR can be downloaded from https://github.com/ablab-nthu/CSAR. Contact: [email protected] or [email protected]. Supplementary information: Supplementary data are available at Bioinformatics online.
Kun-Tze Chen, Chia-Liang Liu, Shang-Hao Huang, Hsin-Ting Shen, Yi-Kung Shieh, Hsien-Tai Chiu, Chin Lung Lu
Bioinform.5