-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathLCS_Bryan.java
127 lines (102 loc) · 3.51 KB
/
LCS_Bryan.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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
import java.io.*;
import static java.time.Clock.system;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.Scanner;
import java.math.*;
public class LCS_Bryan {
public static void fil_col_zero (int mat[][], int n , int m){ // n i m guardan la longitud de las cades x e y
int i, j;
for(i=0; i< n ; i++){
mat[i][0]=2*i;
}
for (j=0; j< m; j++){
mat[0][j]=2*j;
}
}
public static int lcs (String x, String y, int n, int m){
int [][] mat= new int[n][m];
for(int i=1; i< n ; i++){
for(int j=1; j< m;j++){
if(x.charAt(i-1) != y.charAt(j-1)){
mat[i][j]=mat[i-1][j-1]+1;
mat[i][j]= Math.min(mat[i-1][j]+2,mat[i][j]);
mat[i][j]= Math.min(mat[i][j-1]+2,mat[i][j]);
}
else{
mat[i][j]=mat[i-1][j-1];
}
}
}
return mat[n-1][m-1];
}
public static void main(String[] argv) throws IOException{
String cad = null;
int m=argv.length;
List<String> noms= new ArrayList<String>();
List<String> ncadenes=new ArrayList<String>();
List<Genoma> genomes = new ArrayList<Genoma>();
noms.add("Bovi");noms.add("Cocodril");noms.add("Conill");noms.add("Gallina");noms.add("Gat");noms.add("Gos"); noms.add("huma");noms.add("macaco"); noms.add("orangutan");
noms.add("ovi"); noms.add("porc");noms.add("ratoli");noms.add("ximpanze");
for(int i=0;i < m; i++){
String cadena;
File fichero;
FileReader f;
BufferedReader b;
fichero = new File("C:/Users/Skylake-Adry/Desktop/PROP/Nucleotids proteina albumina/",argv[i]);
f=new FileReader(fichero);
b=new BufferedReader(f);
String linea;
while((linea=b.readLine())!=null){
cad=linea;
}
ncadenes.add(cad);
}
Iterator it=noms.iterator();
Iterator it2=ncadenes.iterator();
while(it.hasNext() && it2.hasNext()){
Genoma g;
g=new Genoma((String) it2.next(), (String) it.next());
genomes.add(g);
}
/*int[][] taula=taula_coincidencies(genomes);
for (int i = 0; i < genomes.size(); i++) {
for (int j = 0; j <genomes.size() ; j++) {
System.out.println(taula[i][j]);
}
}
*/
}
/* public static int[][] taula_coincidencies(List<Genoma> a){
int [][] taula_coinci=new int [a.size()][a.size()];
Iterator it =a.iterator();
Iterator it2=a.iterator();
int i=0;
int j=0;
while(i<a.size() || it2.hasNext()){
while(j<a.size() || it.hasNext()){
taula_coinci[i][j]=lcs(it.next().getCadena(),it2.next().getCadena(),it.next().getCadena().length(),it2.next().getCadena().length());
if(j==a.size()-1){
j=0;
}
else ++j;
if(!it.hasNext()){
it=a.iterator();
}
if(!it.hasNext()){
it=a.iterator();
}
}
if(i==a.size()-1){
i=0;
}
else ++i;
if(!it2.hasNext()){
it=a.iterator();
}
}
return taula_coinci;
}
*/
}