- Author
- Leandro Rabindranath Leon
# include <iostream>
# include <string>
{
const std::string a = "AGGTAB";
const std::string b = "GXTXAYB";
const auto lcs = longest_common_subsequence(a, b);
const auto lcss = longest_common_substring("xabxac", "abcabxabcd");
std::cout << "LCS / Longest Common Substring Example\n";
std::cout << "a = " << a << "\n";
std::cout << "b = " << b << "\n\n";
std::cout << "LCS length: " << lcs.length << "\n";
std::cout << "LCS value : " << lcs.subsequence << "\n\n";
std::cout << "Longest Common Substring length: " << lcss.length << "\n";
std::cout << "Substring: " << lcss.substring << "\n";
std::cout << "Begin in first string : " << lcss.begin_a << "\n";
std::cout << "Begin in second string: " << lcss.begin_b << "\n";
return 0;
}
Dynamic-programming algorithms for string similarity and alignment.
Main namespace for Aleph-w library functions.