[Seqan-dev] Approximate Searching in set of strings

[Tilo Eißler <eissler@in.tum.de>]

Hi everyone,

as the subject implies I have a question about approximate searching in
sets of strings with Seqan.

What I want to do: Search for patterns (exact and approximate) in a set
of DNA or RNA sequence strings.

What I've tried so far is to generate an index for the set of strings
and search exact patterns, which works fine.

I've also created a finder for a single test string and tried searching
approximately as it is shown in the documentation. No problem so far.

What I want to know now is if it is generally possible to create an
index for a set of strings and search approximately using a finder for
this index?

Maybe there is some documentation I didn't recognize so far.
I've tried the seqan 1.2 stable release as well as the svn trunk.

Thank you very much in advance.

Best wishes,

Tilo

P.S. I'm currently using Eclipse under Linux as IDE for developing C++.
Unfortunately the integrated C++-indexer has some problems with seqan
running out of heap-space. Which IDE do you use? Or do you have any
hints how to change the eclipse settings to get along with seqan
properly without loosing the benefits of an IDE over a simple text
editor, e.g. code completion? Turning of the C++-indexer is not what I
want to do ;-)

-- 

Dipl.-Inf. Tilo Eißler
Technische Universität München   |tel.   +49-89-289-19478
Institut für Informatik, I10     |
Boltzmannstr. 3                  |Office 02.13.059
85748 Garching b. München        |email  eissler@in.tum.de