RECOMB
2002
Springer
14 years 11 months ago
2002
Springer
This talk presents an algorithm to search for all approximate matches of a helix in a genome, where a helix is a combination of sequence and folding constraints. It is a joint wor...