search

mslehre / MAS

Maximum Acyclic Subgraph (MAS) - Multiple Sequence Alignment (MSA) Game
1 stars 0 forks source link

Alignment state + actions #6

Closed felbecker closed 5 years ago

felbecker commented 5 years ago

Suppose the set E of edges in the graph defined in #3 is known (which corresponds to the set of possible k-mer alignment in subsequent sequences).

Let a state S denote the currently selected and consistent subset of chosen edges. Write a class to encapsulate such a state. Add a "possibleActions" method, that outputs a list of valid moves given the current state.

mauricerad commented 5 years ago

Die edges werden in einem Array der Länge 3 gespeichert. Der 1. Eintrag beschreibt den Index der i-ten Sequenz (die zweite Sequenz hat dann Index i+1), der 2. Eintrag ist der Index des k-mer in der i-ten Sequenz und der 3. Eintrag der Index des k-mer in der i+1-ten Sequenz.