| 2007 |
|---|
| 7 | EE | Tatsuya Akutsu,
Hideo Bannai,
Satoru Miyano,
Sascha Ott:
On the complexity of deriving position specific score matrices from positive and negative sequences.
Discrete Applied Mathematics 155(6-7): 676-685 (2007) |
| 2005 |
|---|
| 6 | EE | Sascha Ott,
A. Hansen,
SunYong Kim,
Satoru Miyano:
Superiority of network motifs over optimal networks and an application to the revelation of gene network evolution.
Bioinformatics 21(2): 227-238 (2005) |
| 2004 |
|---|
| 5 | EE | Sascha Ott,
Seiya Imoto,
Satoru Miyano:
Finding Optimal Models for Small Gene Networks.
Pacific Symposium on Biocomputing 2004: 557-567 |
| 2003 |
|---|
| 4 | EE | Sascha Ott,
Yoshinori Tamada,
Hideo Bannai,
Kenta Nakai,
Satoru Miyano:
Intrasplicing - Analysis of Long Intron Sequences.
Pacific Symposium on Biocomputing 2003: 339-350 |
| 2002 |
|---|
| 3 | EE | Tatsuya Akutsu,
Sascha Ott:
Inferring a Union of Halfspaces from Examples.
COCOON 2002: 117-126 |
| 2 | EE | Tatsuya Akutsu,
Hideo Bannai,
Satoru Miyano,
Sascha Ott:
On the Complexity of Deriving Position Specific Score Matrices from Examples.
CPM 2002: 168-177 |
| 1999 |
|---|
| 1 | EE | Sascha Ott:
Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2.
WG 1999: 55-64 |
