Step-by-Step Calculation of All Maximum Common Substructures through a Constraint Satisfaction Based Algorithm.
Gonzalo Cerruela GarcíaIrene Luque RuizMiguel Ángel Gómez-NietoPublished in: J. Chem. Inf. Model. (2004)
Keyphrases
- constraint satisfaction
- constraint satisfaction problems
- learning algorithm
- optimal solution
- objective function
- search space
- k means
- dynamic programming
- neural network
- search strategy
- path consistency
- forward checking
- computational complexity
- linear programming
- benchmark problems
- randomly generated
- relaxation labeling
- russian doll search