object
SmithWaterman
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
_optimalAlignment[S, C, M, I, V](i: I, j: I, A: S, B: S, w: (C, C, V) ⇒ V, mismatchPenalty: V, gap: C, H: M)(implicit arg0: Ring[I], arg1: Order[I], arg2: Ring[V], arg3: Order[V], la: LinearAlgebra[M, I, I, V], indexed: Indexed[S, I, C]): Stream[(C, C)]
-
def
alignStep[S, C, M, I, V](i: I, j: I, A: S, B: S, w: (C, C, V) ⇒ V, H: M, mismatchPenalty: V, gap: C)(implicit arg0: Ring[I], arg1: Order[I], arg2: Ring[V], arg3: Order[V], arg4: Eq[V], la: LinearAlgebra[M, I, I, V], indexed: Indexed[S, I, C]): (C, C, I, I)
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
computeH[S, C, M, I, V](A: S, B: S, w: (C, C, V) ⇒ V, mismatchPenalty: V)(implicit arg0: Ring[I], arg1: Ring[V], arg2: Order[V], la: LinearAlgebra[M, I, I, V], indexed: Indexed[S, I, C], finite: Finite[S, I]): M
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
optimalAlignment[S, C, M, I, V](A: S, B: S, w: (C, C, V) ⇒ V, mismatchPenalty: V, gap: C)(implicit arg0: Ring[I], arg1: Order[I], arg2: Ring[V], arg3: Order[V], la: LinearAlgebra[M, I, I, V], indexed: Indexed[S, I, C], finite: Finite[S, I], fs: FromStream[S, C]): (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
http://en.wikipedia.org/wiki/Smith-Waterman_algorithm