-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathMain.java
36 lines (34 loc) · 968 Bytes
/
Main.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
import java.util.Arrays;
/**
* This class is an example runner
* for NeedlemanWunsch.java
*
* @author Andrew Quach
* @author Tamir Enkhjargal
*
* @version 2.0.0
*/
public class Main {
/**
* Method that creates a NeedlemanWunsch object and
* prints out the Strand information.
*/
public static void main(String[] args) {
// Create a NeedlemanWunsch object
// Strand1 = CGUCC
// Strand2 = GCCC
// Match = 5
// Mismatch = -3
// Indel = -5
// Allow mismatching
NeedlemanWunsch n1 = new NeedlemanWunsch("CGUCC", "GCCC", 5, -3, -5, true);
// Print out the information
n1.printStrandInfo();
System.out.println(Arrays.deepToString(n1.getSolution()));
// Strand1 = CGUCC
// Strand2 = GCCC
// Do notn allow mismatching
NeedlemanWunsch n2 = new NeedlemanWunsch("CGUCC", "GCCC", false);
n2.printStrandInfo();
}
}