#include <seqan/graph.h>
#include <iostream>

using namespace seqan;

int main() {
	String<char> seq1("abacx");
	String<char> seq2("baabca");
	String<std::pair<unsigned int, unsigned int>, Block<> > pos;
	longestCommonSubsequence(seq1, seq2, pos);
	std::cout << seq1 << std::endl;
	std::cout << seq2 << std::endl;
	std::cout << "Lcs:" << std::endl;
	for(int i = length(pos)-1; i>=0; --i) {
		std::cout << seq1[pos[i].first] <<  ',';
	}
	std::cout << std::endl;
	for(int i = length(pos)-1; i>=0; --i) {
		std::cout << seq2[pos[i].second] <<  ',';
	}
	std::cout << std::endl;
	return 0;
}