/ 
Algorithm-NCS-0.04
River stage zero No dependents
/ Algorithm::NCS

NAME

Algorithm::NCS - Fast Perl extension for sequence alignment.

SYNOPSIS

use Algorithm::NCS;
Algorthm::NCS::ncs("ABC", "ADC");

DESCRIPTION

Number of Common Substrings (NCS) - A model and algorithm for sequence alignment. The change detection problem is aimed at identifying common and different strings and usually has non-unique solutions. The identification of the best alignment is canonically based on finding a longest common subsequence (LCS) and is widely used for various purposes. However, many recent version control systems prefer alternative heuristic algorithms which not only are faster but also usually produce better alignment than finding an LCS. http://psta.psiras.ru/read/psta2015_1_189-197.pdf

http://elib.sfu-kras.ru/bitstream/handle/2311/19864/Znamenskij.pdf?sequence=1

http://dl.acm.org/citation.cfm?id=2977230

EXPORT

# None by default. ncs

SEE ALSO

http://psta.psiras.ru/read/psta2015_1_189-197.pdf

http://elib.sfu-kras.ru/bitstream/handle/2311/19864/Znamenskij.pdf?sequence=1

http://dl.acm.org/citation.cfm?id=2977230

AUTHOR

Vladislav Dyachenko, <ddb@>

COPYRIGHT AND LICENSE

Copyright (C) 2016 by Vladislav Dyachenko

This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself, either Perl version 5.20.2 or, at your option, any later version of Perl 5 you may have available.