Trait omnitigs::omnitigs::NodeCentricOmnitigs

pub trait NodeCentricOmnitigs<Graph: GraphBase, NodeCentricOmnitigsSubsequence: Sequence<VecNodeWalk<Graph>, NodeCentricOmnitigsSubsequence> + ?Sized>: From<Vec<VecNodeWalk<Graph>>> + Sequence<VecNodeWalk<Graph>, NodeCentricOmnitigsSubsequence> {
    // Provided methods
    fn compute_trivial_node_centric_omnitigs(graph: &Graph) -> Self
       where Graph: StaticGraph { ... }
    fn compute_trivial_node_centric_omnitigs_non_scc(graph: &Graph) -> Self
       where Graph: StaticGraph { ... }
    fn remove_reverse_complements(&mut self, graph: &Graph)
       where Graph: StaticBigraph,
             Self: FromIterator<VecNodeWalk<Graph>> { ... }
}

A collection of node-centric omnitigs.

Provided Methods

fn compute_trivial_node_centric_omnitigs(graph: &Graph) -> Selfwhere Graph: StaticGraph,

Compute the trivial node-centric omnitigs in the given strongly connected graph.

fn compute_trivial_node_centric_omnitigs_non_scc(graph: &Graph) -> Selfwhere Graph: StaticGraph,

Compute the trivial node-centric omnitigs in the given graph that may not be strongly connected.

fn remove_reverse_complements(&mut self, graph: &Graph)where Graph: StaticBigraph, Self: FromIterator<VecNodeWalk<Graph>>,

Retains only one direction of each pair of reverse-complemental omnitigs.

Note: I am not sure if this method is correct in all cases, but it will panic if it finds a case where it is not correct. For practical genomes it seems to work.

Implementations on Foreign Types

impl<Graph: 'static + GraphBase> NodeCentricOmnitigs<Graph, [Vec<<Graph as GraphBase>::NodeIndex, Global>]> for Vec<VecNodeWalk<Graph>>

Implementors