Function distances::strings::needleman_wunsch::edits_recursive_custom

source · 
pub fn edits_recursive_custom<U: UInt>(
    penalties: Penalties<U>
) -> impl Fn(&str, &str) -> ([Vec<Edit>; 2], U)
Expand description

Use a custom set of penalties to create a function to that calculates the set of edits needed to turn one unaligned sequence into another, as well as the NW edit distance between the two sequences.

§Arguments:

  • penalties: The penalties to use in the generated function.

§Returns:

A function with the same signature as edits_recursive.