A NEW ALGORITHM TO OBTAIN ALL MAXIMUM COMMON SUBGRAPHS IN MOLECULAR GRAPHS USING BINARY ARITMETHIC AND CONSTRAINTS SATISFACTION MODEL | Publicación