RNAFold-1.99.1.0: RNA secondary structure prediction

Safe HaskellNone

BioInf.RNAfold.Combinators

Description

RNAfold combinators, extracted for quickcheck

Synopsis

Documentation

(~~#) :: (Monad m, Monad m1, Num head, Num head1, Ord head, Ord head1) => xs -> ys -> Box ((:. (:. (:. t head) head) head, t1, t2) -> m (:. (:. (:. (:. t head) head) head) head, t1, t2)) ((:. (:. (:. (:. t3 head1) head1) head1) head1, t4, t5) -> m1 (Step (:. (:. (:. (:. t3 head1) head1) head1) head1, t4, t5) (:. (:. (:. (:. t3 head1) head1) head1) head1, t4, t5))) xs ysSource

The structure on the right is a subword with size 2-30, however we inspect the stack an reduce the maximal size.

(#~~) :: (Monad m, Monad m1, Num t1, Num t, Ord t1) => xs -> ys -> Box ((:. (:. tail t) head, t2, t3) -> m (:. (:. (:. tail t) t) head, t2, t3)) ((:. (:. (:. tail1 t1) t1) t1, t4, t5) -> m1 (Step (:. (:. (:. tail1 t1) t1) t1, t4, t5) (:. (:. (:. tail1 t1) t1) t1, t4, t5))) xs ysSource

The structure on the left is a subword with size 2-28. The maximal size could be 30 but since the two combinators are linked, 29,30 would fail anyways.