object
NeedlemanWunsch
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
-
def
_optimalAlignment[S, N, M, I, V](i: I, j: I, A: S, B: S, similarity: (N, N) ⇒ V, gap: N, gapPenalty: V, F: M)(implicit arg0: Eq[N], arg1: Ring[I], arg2: Order[I], arg3: AdditiveMonoid[V], arg4: Eq[V], la: LinearAlgebra[M, I, I, V], indexed: Indexed[S, I, N]): Stream[(N, N)]
-
def
alignStep[S, N, M, I, V](i: I, j: I, A: S, B: S, F: M, similarity: (N, N) ⇒ V, gap: N, gapPenalty: V)(implicit arg0: Eq[N], arg1: Ring[I], arg2: Order[I], arg3: AdditiveMonoid[V], arg4: Eq[V], la: LinearAlgebra[M, I, I, V], indexed: Indexed[S, I, N]): (N, N, I, I)
-
def
alignmentScore[S, N, I, M, V, SS, G](A: S, B: S, gap: N, similarity: (N, N) ⇒ V, gapPenalty: V)(implicit arg0: Eq[N], arg1: Ring[I], arg2: Eq[I], arg3: AdditiveMonoid[V], arg4: Eq[V], indexed: Indexed[S, I, N], finite: Finite[S, I], zipper: Zipper[S, N, S, N, SS], functor: Functor[SS, (N, N), V, G], agg: Aggregatable[G, V, V]): V
-
def
alignmentScoreK1[C[_], N, I, M, V](a: C[N], b: C[N], gap: N, similarity: (N, N) ⇒ V, gapPenalty: V)(implicit arg0: Eq[N], arg1: Ring[I], arg2: Eq[I], arg3: AdditiveMonoid[V], arg4: Eq[V], indexed: IndexedK1[C, I, N], finite: FiniteK1[C, N, I], zipper: ZipperK1[C, N, N], functor: FunctorK1[C, (N, N), V], agg: AggregatableK1[C, V, V]): V
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
computeF[I, S, N, M, V](A: S, B: S, similarity: (N, N) ⇒ V, gapPenalty: V)(implicit arg0: Ring[I], arg1: AdditiveMonoid[V], arg2: Order[V], la: LinearAlgebra[M, I, I, V], indexed: Indexed[S, I, N], finite: Finite[S, I], module: Module[V, I]): M
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
optimalAlignment[S, N, M, I, V](A: S, B: S, similarity: (N, N) ⇒ V, gap: N, gapPenalty: V)(implicit arg0: Eq[N], arg1: Ring[I], arg2: Order[I], arg3: AdditiveMonoid[V], arg4: Order[V], arg5: Eq[V], la: LinearAlgebra[M, I, I, V], indexed: Indexed[S, I, N], finite: Finite[S, I], fs: FromStream[S, N], module: Module[V, I]): (S, S)
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
http://en.wikipedia.org/wiki/Needleman-Wunsch_algorithm