Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Lin, Yu"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Non-planar square-orthogonal drawing with few-bend edges
Yu-An Lin
,
Sheung-Hung Poon
Theoretical Computer Science
554
, 2014, pp. 150-168
Square-orthogonal drawing with few bends per edge
Yu-An Lin
,
Sheung-Hung Poon
Lecture Notes in Computer Science
7936
, 2013, pp. 361-372
On superconnectivity of
(4,g)
cages
Hongliang Lu
,
Yunjian Wu
,
Yuqing Lin
,
Qinglin Yu
,
Camino Babuena
,
Xavier Marcote
Graphs and Combinatorics
29
(1), 2013, pp. 105-119
TIBA: A tool for phylogeny inference from rearrangement data with bootstrap analysis
Yu Lin
,
Vaibhav Rajan
,
Bernard M.E. Moret
Bioinformatics
28
(24), 2012, pp. 3324-3325
A spectral graph theoretic approach to quantification and calibration of collective morphological differences in cell images
Yu-Shi Lin
,
Chung-Chih Lin
,
Yuh-Show Tsai
,
Tien-Chuan Ku
,
Yi-Hung Huang
,
Chun-Nan Hsu
Bioinformatics
26
(12), 2010, pp. 29-37
On superconnectivity of
(4,g)
-cages with even girth
Yuqing Lin
,
Hongliang Lu
,
Yunjian Wu
,
Qinglin Yu
Networks
56
(2), 2010, pp. 143-148
A new genomic evolutionary model for rearrangements, duplications, and losses that applies across eukaryotes and prokaryotes
Yu Lin
,
Bernard M.E. Moret
LNCS/LNBI
6398
, 2010, pp. 228-239
Fast and accurate phylogenetic reconstruction from high-resolution whole-genome data and a novel robustness estimator
Yu Lin
,
Vaibhav Rajan
,
Bernard M.E. Moret
LNCS/LNBI
6398
, 2010, pp. 137-148
Sorting signed permutations by inversions in
O(n\log n)
time
Krister M. Swenson
,
Vaibhav Rajan
,
Yu Lin
,
Bernard M.E. Moret
LNCS/LNBI
5541
, 2009, pp. 386-399
A sufficient condition for pancyclic graphs
Kewen Zhao
,
Yue Lin
,
Ping Zhang
Information Processing Letters
109
(17), 2009, pp. 991-996
Integrating high dimensional bi-directional parsing models for gene mention tagging
Chun-Nan Hsu
,
Yu-Ming Chang
,
Cheng-Ju Kuo
,
Yu-Shi Lin
,
Han-Shen Huang
,
I-Fang Chung
Bioinformatics
24
(13), 2008, pp. 286-294
Estimating true evolutionary distances under the DCJ model
Yu Lin
,
Bernard M.E. Moret
Bioinformatics
24
(13), 2008, pp. 114-122
A fragmentation event model for peptide identification by mass spectrometry
Yu Lin
,
Yantao Qiao
,
Shiwei Sun
,
Chungong Yu
,
Gongjin Dong
,
Dongbo Bu
LNCS/LNBI
4955
, 2008, pp. 154-166
Hurdles hardly have to be heeded
Krister M. Swenson
,
Yu Lin
,
Vaibhav Rajan
,
Bernard M.E. Moret
LNCS/LNBI
5267
, 2008, pp. 241-251
Approximation algorithms for biclustering problems
Lusheng Wang
,
Yu Lin
,
Xiaowen Liu
SIAM Journal on Computing
38
(4), 2008, pp. 1504-1518
Boosting multiclass learning with repeating codes and weak detectors for protein subcellular localization
Chung-Chih Lin
,
Yuh-Show Tsai
,
Yu-Shi Lin
,
Tai-Yu Chiu
,
Chia-Cheng Hsiung
,
May-I. Lee
,
Jeremy C. Simpson
,
Chun-Nan Hsu
Bioinformatics
23
(24), 2007, pp. 3374-3381
TSSub: Eukaryotic protein subcellular localization by extracting features from profiles
Jian Guo
,
Yuanlie Lin
Bioinformatics
22
(14), 2006, pp. 1784-1785
All
(k;g)
-cages are edge-superconnected
Yuqing Lin
,
Mirka Miller
,
C. Balbuena
,
X. Marcote
Networks
47
(2), 2006, pp. 102-110
All
(k;g)
-cages are
k
-edge-connected
Yuqing Lin
,
Mirka Miller
,
Chris Rodger
Journal of Graph Theory
48
(3), 2005, pp. 219-227
The Binding Database: Data management and interface design
Xi Chen
,
Yuhmei Lin
,
Ming Liu
,
Michael K. Gilson
Bioinformatics
18
(1), 2002, pp. 130-139
A simple framework to calculate the reaching definition of array references and its use in subscript array analysis
Yuan Lin
,
David Padua
Lecture Notes in Computer Science
1586
, 1999, pp. 1036-1045