This module is a simple re-packaging of Joe Schaefer's excellent but not very well-known Algorithm::LCS with a drop-in interface that simply re-uses the installed version of the Algorithm::Diff module. Note that only the "LCSidx" function is optimize...

This is a simple module to select the best available implementation of the standard "diff" algorithm, which works by effectively trying to solve the Longest Common Subsequence (LCS) problem. This algorithm is described in: *A Fast Algorithm for Compu...

One of the difficulties when using diff modules is that they assume they know what you want the information for. Some give you formatted output, some give you just the values that changes (but neglect to mention how each changed) and some (such as Al...

This module can be used to generate binary deltas describing the differences between two files. Given the first file and the delta the second file can be reconstructed. A delta is equivalent to the output of the unix "diff" program, except that it ca...

Crossover operator for a GA, takes args by reference and issues two children from two parents...

Crossover operator for a GA acting only on those bits that are different....

This module uses Algoritm::Diff to implement LCSS and is orders of magnitude faster than String::LCSS. If you pass the methods array refs you get back array (ref) format data. If you pass strings you get a string or a ref to an array of strings....

Algorithm::Annotate generates a list that is useful for generating output simliar to "cvs annotate"....

This module leverages Algorithm::Diff to let you compare the degree of sameness of array or strings. It returns a result set that defines exactly how similar these things are....

Sequence alignment is a way to find commonalities in two (or more) similar sequences or strings of some items or characters. Standard motivating example is the comparison of DNA sequences and their functional and evolutionary similarities and differe...