In this paper, genetic algorithms are applied to solve the error-correcting subgraph isomorphism ("I) problems. The error-correcting subgraph isomorphism problems are first formulated as permutation searching problems. Two ECSl algorithms are devised. The first algorithm implements pure genetic algorithms with permutation representation. The second is a hybrid algorithm that amalgamates assignment algorithms and local search strategy to improve convergence speed. From experiments, the second algorithm shows better performance than the first one and also reveals that the approach is superior to traditional tree search approach