The following pages link to Yasubumi Sakakibara (Q751303):
Displayed 29 items.
- (Q198862) (redirect page) (← links)
- On learning from queries and counterexamples in the presence of noise (Q751304) (← links)
- Learning context-free grammars from structural data in polynomial time (Q917318) (← links)
- PSSMTS: Position specific scoring matrices on tree structures (Q938125) (← links)
- Operon structure optimization by random self-assembly (Q968399) (← links)
- Efficient learning of context-free grammars from positive structural examples (Q1186808) (← links)
- Splicing on tree-like structures (Q1274596) (← links)
- Recent advances of grammatical inference (Q1390941) (← links)
- DNA-based algorithms for learning Boolean formulae (Q1424776) (← links)
- Sticker systems with complex structures (Q1606780) (← links)
- Noise-tolerant Occam algorithms and their applications to learning decision trees (Q2366679) (← links)
- Learning context-free grammars using tabular representations (Q2485075) (← links)
- (Q2754019) (← links)
- (Q3396571) (← links)
- (Q3774999) (← links)
- (Q3814770) (← links)
- (Q4263696) (← links)
- (Q4414691) (← links)
- (Q4470576) (← links)
- (Q4529983) (← links)
- (Q4654645) (← links)
- (Q4737637) (← links)
- (Q4738307) (← links)
- (Q4782115) (← links)
- (Q4793136) (← links)
- DNA Computing (Q5717657) (← links)
- Aspects of Molecular Computing (Q5901839) (← links)
- Multiple splicing systems and the universal computability (Q5941559) (← links)
- Grammatical inference: An old and new paradigm (Q6061882) (← links)