default search action
Yaw-Ling Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [c25]Guan-Jie Hua, Chuan Yi Tang, Che-Lun Hung, Yaw-Ling Lin:
Cloud computing service framework for bioinformatics tools. BIBM 2015: 1509-1513 - 2014
- [c24]Chen-En Hsieh, Grace Shiahuy Chen, Chun-Jung Chen, Yaw-Ling Lin:
Biomolecular Docking Sites Selection by Surface Filtration and Refinement. ICS 2014: 1918-1929 - [c23]Wen-Pei Chen, Suh-Jen Jane Tsai, Ming-Li Liou, Chi-Ying Tsai, Ki-Hok Liao, Chun-Jung Chen, Yaw-Ling Lin:
Metagenomic Analysis of Human Oral Microbiome Composition on the Cloud Platform. ICS 2014: 2019-2029 - 2013
- [j10]Yaw-Ling Lin
, Charles B. Ward, Steven Skiena:
Synthetic Sequence Design for Signal Location Search. Algorithmica 67(3): 368-383 (2013) - [c22]Che-Lun Hung, Hsiao-Hsi Wang, Jieh-Shan Yeh, Yu-Chen Hu
Preference Utility algorithm using GPGPU architecture. ICIS 2013: 155-160 - 2012
- [c21]Che-Lun Hung, Yaw-Ling Lin
Efficient protein structure alignment algorithms under the MapReduce framework. CloudCom 2012: 753-758 - [c20]Yaw-Ling Lin
Synthetic Sequence Design for Signal Location Search. RECOMB 2012: 165-179 - 2011
- [j9]Che-Lun Hung, Chun-Yuan Lin, Shih-Cheng Chang, Yeh-Ching Chung, Shu Ju Hsieh, Chuan Yi Tang, Yaw-Ling Lin
Multiple genome sequences alignment algorithm based on coding regions. Int. J. Comput. Biol. Drug Des. 4(2): 165-178 (2011) - [c19]Shueh-Cheng Hu, I-Ching Chen, Yaw-Ling Lin
Building Cost-Efficient Computer-Aided Learning Environments via Virtualization and Service-Based Software. CSEE (4) 2011: 525-529 - [c18]Che-Lun Hung, Yaw-Ling Lin
CloudTSS: A TagSNP Selection Approach on Cloud Computing. FGIT-GDC 2011: 525-534 - [c17]Chun-Yuan Lin, Chuan Yi Tang, Sheng-Ta Li, Yaw-Ling Lin
CUDA-FRESCO: Frequency-Based RE-Sequencing Tool Based on CO-clustering Segmentation by GPU. HPCC 2011: 857-862 - [c16]Sheng Xiang Fan, Jieh-Shan Yeh, Yaw-Ling Lin
Hybrid Temporal Pattern Mining with Time Grain on Stock Index. ICGEC 2011: 212-215 - [c15]Che-Lun Hung, Yaw-Ling Lin
Efficient GPGPU-Based Parallel Packet Classification. TrustCom 2011: 1367-1374 - [c14]Yaw-Ling Lin
Constructing Orthogonal de Bruijn Sequences. WADS 2011: 595-606 - 2010
- [c13]Che-Lun Hung, Chun-Yuan Lin, Shih-Cheng Chang, Yeh-Ching Chung, Shu Ju Hsieh, Chuan Yi Tang, Yaw-Ling Lin
CORAL-M: Heuristic coding region alignment method for multiple genome sequences. BIBM Workshops 2010: 223-228
2000 – 2009
- 2008
- [c12]Yaw-Ling Lin
Efficient Algorithms for SNP Haplotype Block Selection Problems. COCOON 2008: 309-318 - 2007
- [j8]Yin-Te Tsai, Yaw-Ling Lin
Efficient algorithms for the minimum connected domination on trapezoid graphs. Inf. Sci. 177(12): 2405-2417 (2007) - 2005
- [j7]Hsun-Chang Chang, Po-Shun Yu, Tze-Wei Huang, Fang-Rong Hsu, Yaw-Ling Lin
The application of alternative splicing graphs in quantitative analysis of alternative splicing form from EST database. Int. J. Comput. Appl. Technol. 22(1): 14-22 (2005) - [c11]Hsun-Chang Chang, Kuan-Ching Li
Performance Issues of Grid Computing Based on Different Architecture Cluster Computing Platforms. AINA 2005: 321-324 - 2004
- [c10]Hsun-Chang Chang, Po-Shun Yu, Tze-Wei Huang, Yaw-Ling Lin, Fang-Rong Hsu:
The Application of Alternative Splicing Graphs in Quantitative Analysis of Alternative Splicing Form from EST Database. BIBE 2004: 293-300 - [c9]Fang-Rong Hsu, Hwan-You Chang, Yaw-Ling Lin
Genome-Wide Alternative Splicing Events Detection through Analysis of Large Scale ESTs. BIBE 2004: 310-316 - 2003
- [j6]Yaw-Ling Lin
MAVG: locating non-overlapping maximum average segments in a given sequence. Bioinform. 19(1): 151-152 (2003) - [c8]Yaw-Ling Lin, Tsan-sheng Hsu:
Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome. ISAAC 2003: 339-351 - 2002
- [j5]Yin-Te Tsai, Yaw-Ling Lin
The on-line first-fit algorithm for radio frequency assignment problems. Inf. Process. Lett. 84(4): 195-199 (2002) - [j4]Yaw-Ling Lin
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. J. Comput. Syst. Sci. 65(3): 570-586 (2002) - [j3]Yaw-Ling Lin:
Triangle Graphs and Simple Trapezoid Graphs. J. Inf. Sci. Eng. 18(3): 467-473 (2002) - [c7]Yaw-Ling Lin:
Minimum Back-Walk-Free Latency Problem. COCOON 2002: 525-534 - [c6]Yaw-Ling Lin, Tao Jiang
Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis. MFCS 2002: 459-470 - 2000
- [c5]Yaw-Ling Lin, Fang-Rong Hsu, Yin-Te Tsai:
Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs. COCOON 2000: 126-136
1990 – 1999
- 1999
- [c4]Fang-Rong Hsu, Yaw-Ling Lin, Yin-Te Tsai:
Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs. ISAAC 1999: 173-182 - 1998
- [c3]Yaw-Ling Lin:
Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs. ISAAC 1998: 267-276 - 1995
- [j2]Yaw-Ling Lin, Steven Skiena
Complexity aspects of visibility graphs. Int. J. Comput. Geom. Appl. 5(3): 289-312 (1995) - [j1]Yaw-Ling Lin, Steven Skiena
Algorithms for Square Roots of Graphs. SIAM J. Discret. Math. 8(1): 99-118 (1995) - 1994
- [c2]Yaw-Ling Lin:
Triangle Graphs and Their Coloring. ORDAL 1994: 128-142 - 1991
- [c1]Yaw-Ling Lin, Steven Skiena:
Algorithms for Square Roots of Graphs. ISA 1991: 12-21
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: