8. CPM 1997:
Aarhus, Denmark
Shmuel T. Klein:
Space- and Time-Efficient Decoding with Canonical Huffman Trees. 65-75
Thorsten Richter:
A New Algorithm for the Ordered Tree Inclusion Problem. 150-166
Saïd Abdeddaïm:
On Incremental Computation of Transitive Closure and Greedy Alignment. 167-179
Lars Arvestad:
Aligning Coding DNA in the Presence of Frame-Shift Errors. 180-190
Enno Ohlebusch:
A Filter Method for the Weighted Local Similarity Search Problem. 191-205
Marie-France Sagot,
Alain Viari:
Flexible Identification of Structural Objects in Nucleic Acid Sequences: Palindromes, Mirror Repeats, Pseudoknots and Triple Helices. 224-246