object
SmithWaterman
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
_optimalAlignment(i: Int, j: Int, A: String, B: String, mismatchPenalty: Int, H: matrix.JblasMatrixModule.Matrix[Int]): Stream[(Char, Char)]
-
def
alignStep(i: Int, j: Int, A: String, B: String, H: matrix.JblasMatrixModule.Matrix[Int], mismatchPenalty: Int): (Char, Char, Int, Int)
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
computeH(A: String, B: String, mismatchPenalty: Int): matrix.JblasMatrixModule.Matrix[Int]
-
val
defaultMismatchPenalty: Int
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
val
gap: Char
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
metricSpace(mismatchPenalty: Int = defaultMismatchPenalty): MetricSpace[String, Int]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
optimalAlignment(A: String, B: String, mismatchPenalty: Int = defaultMismatchPenalty): (String, String)
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
w(x: Char, y: Char, mismatchPenalty: Int): Int
-
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/Smith-Waterman_algorithm