[−][src]Struct seqalign::measures::LCS

pub struct LCS { /* fields omitted */ }

Longest common subsequence (LCS) alignment.

This measure uses the following edit operations:

  • Insert
  • Delete
  • Match

The matches in edit script for this measure give a longest common subsequence. The cost is the number of insertions/deletions after aligning the LCSes.

Implementations

impl LCS[src]

Construct LCS measure with the associated insertion and deletion cost.

pub fn new(insert_cost: usize, delete_cost: usize) -> Self[src]

Trait Implementations

impl Clone for LCS[src]

impl Debug for LCS[src]

impl<T> Measure<T> for LCS where
    T: Eq, [src]

type Operation = LCSOp

The edit operations associated with the measure.

Auto Trait Implementations

impl RefUnwindSafe for LCS

impl Send for LCS

impl Sync for LCS

impl Unpin for LCS

impl UnwindSafe for LCS

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized, [src]

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

impl<T> BorrowMut<T> for T where
    T: ?Sized, [src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, [src]

impl<T> ToOwned for T where
    T: Clone, [src]

type Owned = T

The resulting type after obtaining ownership.

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.