| 1 |
|
| 2 |
A more complex example - looking for patterns in DNA sequences. |
| 3 |
|
| 4 |
This example derived from undergraduate project work by Julia Fischer |
| 5 |
at the University of Durham. Some of the grammar is based on the ones |
| 6 |
developed by Siu-wai Leung, Chris Mellish, and Dave Robertson at the |
| 7 |
University of Edinburgh. (Contact Paul Callaghan for details, and |
| 8 |
see the accompanying paper.) |
| 9 |
|
| 10 |
Files 1-600.dna and 1-1200.dna contain 600 (1200) bases from the sequence |
| 11 |
for E. coli. The first sequence parses in a few minutes, the second takes |
| 12 |
a bit longer. |
| 13 |
|
| 14 |
There are issues about how to efficiently skip over "noise" in the data. |
| 15 |
This would make the parser faster. |
| 16 |
|
| 17 |
Use "make run" to parse the 1-1200.dna sequence - it should take under 15 |
| 18 |
seconds |
| 19 |
|
| 20 |
|
| 21 |
|