| 2008 |
|---|
| 9 | EE | Shuai Cheng Li,
Yen Kaow Ng,
Louxin Zhang:
A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance.
FAW 2008: 35-44 |
| 8 | EE | Yen Kaow Ng,
Takeshi Shinohara:
Developments from enquiries into the learnability of the pattern languages from positive data.
Theor. Comput. Sci. 397(1-3): 150-165 (2008) |
| 2007 |
|---|
| 7 | EE | Sanjay Jain,
Yen Kaow Ng,
Tiong Seng Tay:
Learning languages in a union.
J. Comput. Syst. Sci. 73(1): 89-108 (2007) |
| 2006 |
|---|
| 6 | EE | Yen Kaow Ng,
Takeshi Shinohara:
Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses.
ICGI 2006: 307-319 |
| 5 | EE | Yen Kaow Ng,
Takeshi Shinohara:
Finding Consensus Patterns in Very Scarce Biosequence Samples from Their Minimal Multiple Generalizations.
PAKDD 2006: 540-545 |
| 2005 |
|---|
| 4 | EE | Yen Kaow Ng,
Takeshi Shinohara:
Inferring Unions of the Pattern Languages by the Most Fitting Covers.
ALT 2005: 269-282 |
| 3 | EE | Hirotaka Ono,
Yen Kaow Ng:
Best Fitting Fixed-Length Substring Patterns for a Set of Strings.
COCOON 2005: 240-250 |
| 2 | EE | Yen Kaow Ng,
Hirotaka Ono,
Takeshi Shinohara:
Measuring Over-Generalization in the Minimal Multiple Generalizations of Biosequences.
Discovery Science 2005: 176-188 |
| 2001 |
|---|
| 1 | EE | Sanjay Jain,
Yen Kaow Ng,
Tiong Seng Tay:
Learning Languages in a Union.
ALT 2001: 235-250 |
