Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Lin-Yu Tseng 0001

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Hsuan-Hung Lin

> Home > Persons > Lin-Yu Tseng 0001

Publications

2013
[j23]
- view
  authority control:
- export record
  dblp key:
  - journals/cbm/LinHHPCT13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cbm/LinHHPCT13
Hsuan-Hung Lin, Jiin-Chyr Hsu, Yuan-Nian Hsu, Ren-Hao Pan, Yung-fu Chen, Lin-Yu Tseng:
Disulfide connectivity prediction based on structural information without a prior knowledge of the bonding state of cysteines. Comput. Biol. Medicine 43(11): 1941-1948 (2013)
2012
[j20]
- view
  authority control:
- export record
  dblp key:
  - journals/isci/LinT12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/isci/LinT12
Hsuan-Hung Lin, Lin-Yu Tseng:
Prediction of disulfide bonding pattern based on a support vector machine and multiple trajectory search. Inf. Sci. 199: 167-178 (2012)
2010
[j18]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/nar/LinT10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/nar/LinT10
Hsuan-Hung Lin, Lin-Yu Tseng:
DBCP: a web server for disulfide bonding connectivity pattern prediction without the prior knowledge of the bonding state of cysteines. Nucleic Acids Res. 38(Web-Server-Issue): 503-507 (2010)

a service of

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.