 
 	if (min_L <= max_R && max_R - min_L < MAX_rule_span){
 		tempind++;
-
-		//printf("target start %d - tar end %d - sour start %d - sour end %d\n", ss, tt, current_str, t);
 		return true;//consistent( (*target_start),  (*target_end), L_tar, R_tar, start, ender, tempind);		
 	}			
 

	////BASED ON TWO GAP SEED!! 
	/////////////////////////////////////////

	//debugging
	/*	for(int i =0; i< qryset->distinctTwoGapCount;i++){
		printf("EXtract: No. %d --> start %d|end %d\n", i, qryset->twoGapSearch[i].start_on_salist,
		qryset->twoGapSearch[i].end_on_salist);
		}*/		
	///Debugging end

	//Two gap search
	cudaMalloc((void**)&(qryset_d->twoGapSearch), 
			(qryset->distinctTwoGapCount)*sizeof(two_gappy_search));

			L = 255;     
		} else if (k == start){		
			(*tempind) = k - ((temp >> 8) & 0xFF) - 1 ;	
			
			if ((*tempind) == -1){
				(*sen_target_begin) = 0;
			} else {
