1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
|
///A tutorial about finding maximal repeats.
//![includes]
#include <iostream>
#include <seqan/index.h>
using namespace seqan;
//![includes]
//![init]
int main()
{
String<char> myString = "How many wood would a woodchuck chuck.";
typedef Index<String<char> > TMyIndex;
TMyIndex myIndex(myString);
//![init]
//![iteration]
typedef Iterator<TMyIndex, MaxRepeats>::Type TMaxRepeatIterator;
TMaxRepeatIterator myRepeatIterator(myIndex, 3);
while (!atEnd(myRepeatIterator))
{
Iterator<TMaxRepeatIterator>::Type myRepeatPair(myRepeatIterator);
while (!atEnd(myRepeatPair))
{
std::cout << *myRepeatPair << ", ";
++myRepeatPair;
}
std::cout << repLength(myRepeatIterator) << " ";
std::cout << "\t\"" << representative(myRepeatIterator) << '\"' << std::endl;
++myRepeatIterator;
}
return 0;
}
//![iteration]
|
