Struct bio::stats::pairhmm::HomopolyPairHMM[][src]

pub struct HomopolyPairHMM { /* fields omitted */ }

A pair Hidden Markov Model for comparing sequences x and y as described by Durbin, R., Eddy, S., Krogh, A., & Mitchison, G. (1998). Biological Sequence Analysis. Current Topics in Genome Analysis 2008. http://doi.org/10.1017/CBO9780511790492. The default model has been extended to consider homopolymer errors, at the cost of more states and transitions.

Implementations

impl HomopolyPairHMM[src]

pub fn new<G, H>(gap_params: &G, hop_params: &H) -> Self where
    G: GapParameters,
    H: HopParameters
[src]

Create a new instance of a HomopolyPairHMM.

Arguments

  • gap_params - parameters for opening or extending gaps
  • hop_params - parameters for opening or extending hops

Calculate the probability of sequence x being related to y via any alignment.

Arguments

  • emission_params - parameters for emission
  • alignment_mode - parameters for free end/start gaps
  • max_edit_dist - maximum edit distance to consider; if not None, perform banded alignment

Trait Implementations

impl Clone for HomopolyPairHMM[src]

impl Debug for HomopolyPairHMM[src]

Auto Trait Implementations

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> Same<T> for T

type Output = T

Should always be Self

impl<SS, SP> SupersetOf<SS> for SP where
    SS: SubsetOf<SP>, 

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.

impl<V, T> VZip<V> for T where
    V: MultiLane<T>,