mmxgn

def find_frequent_subsequences(seq, K,  minsup, maxgap):
    S = seq
    
    L = []
    
    # Map each individual symbol to its position in the sequence
    for k in range(0, len(seq)):
        L.append((seq[k],k))
        
        

mmxgn

'''
Created on Jul 11, 2013

@author: Emmanuel <eruyome@gmail.com> Chourdakis
'''

import pydot


def dfsmToGraph(DFSM):

mmxgn

from constraint import Problem,\
                       RecursiveBacktrackingSolver,\
                       AllDifferentConstraint,\
                       MinConflictsSolver

import mingus.core.notes as notes
import mingus.extra.LilyPond as LilyPond
from mingus.containers import Bar,Track
from mingus.midi import MidiFileOut