1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
|
#include <iostream>
#include <seqan/graph_algorithms.h>
#include <seqan/graph_align.h>
using namespace seqan2;
int main()
{
// Define two sequences.
String<char> seq1("abacx");
String<char> seq2("baabca");
// Build a StringSet with two elements and an AlignmentGraph over them.
typedef StringSet<String<char>, Dependent<> > TStringSet;
TStringSet string_set;
appendValue(string_set, seq1);
appendValue(string_set, seq2);
Graph<Alignment<TStringSet> > alignment_graph(string_set);
// Compute the longest common subsequence.
std::cout << "Score = " << globalAlignment(alignment_graph, stringSet(alignment_graph), Lcs()) << "\n"
<< alignment_graph << std::endl;
return 0;
}
|
