source: branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/substitution/NearbySubstitutionMatrix.java @ 1568

Last change on this file since 1568 was 1568, checked in by rkrimmel, 10 years ago

Building distance matrix between sequences

File size: 1.0 KB
Line 
1/**
2 *
3 */
4package de.ugoe.cs.autoquest.tasktrees.alignment.substitution;
5
6import java.util.Collection;
7import java.util.List;
8
9import de.ugoe.cs.autoquest.eventcore.Event;
10import de.ugoe.cs.autoquest.tasktrees.treeifc.IUserSession;
11
12/**
13 * @author Ralph Krimmel
14 *
15 */
16public class NearbySubstitutionMatrix implements SubstitutionMatrix {
17
18        private int[] input1;
19        private int[] input2;
20        private int range;
21       
22        public NearbySubstitutionMatrix(int[] input1,int[] input2, int range) {
23                this.input1 = input1;
24                this.input2 = input2;
25                this.range = range;
26        }
27       
28        /* (non-Javadoc)
29         * @see de.ugoe.cs.autoquest.plugin.alignment.SubstitutionMatrix#getDistance(int, int)
30         */
31        public double getDistance(int pos1, int pos2) {
32                int difference = Math.abs(input1[pos1]-input2[pos2]);
33                if(difference < range) {
34                        return range-difference;
35                }
36                else {
37                        return -range;
38                }
39        }
40
41
42        @Override
43        public double getGapPenalty() {
44                return -range-1;
45        }
46
47
48        @Override
49        public void generate() {
50                // TODO Auto-generated method stub
51               
52        }
53
54       
55
56}
Note: See TracBrowser for help on using the repository browser.