动态规划 序列对比 Needleman-Wunsch Smith-Waterman algorthm(java)

【实例简介】
可以使用需要重新加载biojava.jar jar包代码是全的，不会可以问我。jar包在lib目录下面 输出结果： Global alignment with Needleman-Wunsch: Time (ms): 3 Length: 9 Score: 0 Query: query, Length: 9 Target: target, Length: 8 Query: 1 gccctagcg 9 || | | | Target: 1 gcgc-aatg 8 Local alignment with Smith-Waterman:
【实例截图】
【核心代码】
SequenceAlignment
└── SequenceAlignment
├── bin
│   └── com
│   └── ibm
│   ├── biojava
│   │   └── sample
│   │   └── BioJavaSample.class
│   └── compbio
│   ├── Cell.class
│   ├── DynamicProgramming.class
│   ├── misc
│   │   ├── DNAGenerator.class
│   │   └── Fibonacci.class
│   ├── seqalign
│   │   ├── NeedlemanWunsch.class
│   │   ├── SequenceAlignment.class
│   │   └── SmithWaterman.class
│   └── sequence
│   └── LongestCommonSubsequence.class
├── lib
│   ├── biojava3-alignment-3.0.1.jar
│   ├── biojava3-alignment-3.0.5.jar
│   ├── biojava3-alignment-3.0.5-sources.jar
│   ├── biojava3-core-3.0.1.jar
│   ├── biojava3-core-3.0-sources.jar
│   ├── biojava3-structure-gui-3.0.5.jar
│   ├── biojava.jar
│   └── log4j-1.2.15.jar
└── src
└── com
└── ibm
├── biojava
│   └── sample
│   └── BioJavaSample.java
└── compbio
├── Cell.java
├── DynamicProgramming.java
├── misc
│   ├── DNAGenerator.java
│   └── Fibonacci.java
├── seqalign
│   ├── NeedlemanWunsch.java
│   ├── SequenceAlignment.java
│   └── SmithWaterman.java
└── sequence
└── LongestCommonSubsequence.java

20 directories, 26 files