| Safe Haskell | None |
|---|
BioInf.RNAdesign.Graph
- independentGraphs :: [String] -> [Gr () ()]
- mkUnionGraph :: [String] -> Gr () ()
- unions :: Eq b => [Gr a b] -> Gr a b
- pairlistToGraph :: D1Secondary -> Gr () ()
- independentComponents :: DynGraph gr => gr () () -> [gr () ()]
- isBipartite :: DynGraph gr => gr a b -> Bool
Documentation
independentGraphs :: [String] -> [Gr () ()]Source
Given the one to many structures, create the independent graphs, where each graph describes a set of dependent edges in the basepairing.
mkUnionGraph :: [String] -> Gr () ()Source
Union of several graphs, created from secondary structure.
unions :: Eq b => [Gr a b] -> Gr a bSource
Given k graphs, each with nodes [1..n], provide the union of all edges.
pairlistToGraph :: D1Secondary -> Gr () ()Source
Given a pairlist, generate the secondary structure graph.
independentComponents :: DynGraph gr => gr () () -> [gr () ()]Source
Split the graph into (simple, complex) components. The simple components can trivially be filled with any pair. The complex components require an Ear or Woffle decomposition. Simple components are acyclic.
isBipartite :: DynGraph gr => gr a b -> BoolSource
Tests if the given graph is bipartite, which is true if the even/odd BST trees contain no edges