Last change
on this file since 1698 was
1698,
checked in by rkrimmel, 10 years ago
|
Speed improvement by just calculating distances between newly created tasks and the old matrix.
|
File size:
408 bytes
|
Line | |
---|
1 | package de.ugoe.cs.autoquest.tasktrees.alignment.matrix; |
---|
2 | |
---|
3 | import java.util.HashSet; |
---|
4 | import java.util.LinkedList; |
---|
5 | |
---|
6 | import de.ugoe.cs.autoquest.tasktrees.treeifc.ITask; |
---|
7 | |
---|
8 | |
---|
9 | |
---|
10 | public interface SubstitutionMatrix { |
---|
11 | |
---|
12 | |
---|
13 | public double getScore(int pos1, int pos2); |
---|
14 | |
---|
15 | public double getGapPenalty(); |
---|
16 | |
---|
17 | public void generate(HashSet<ITask> uniqueTasks); |
---|
18 | |
---|
19 | public void update(LinkedList<ITask> newlyGeneratedTasks); |
---|
20 | |
---|
21 | |
---|
22 | } |
---|
Note: See
TracBrowser
for help on using the repository browser.