a44421a79fb36cc2036fe116b97ea3bc9590cd0c
braney
  Fri Dec 2 09:34:39 2011 -0800
removed rcsid (#295)
diff --git src/jkOwnLib/fuzzyFind.c src/jkOwnLib/fuzzyFind.c
index 69bc65c..69a23c2 100644
--- src/jkOwnLib/fuzzyFind.c
+++ src/jkOwnLib/fuzzyFind.c
@@ -28,31 +28,30 @@
  * further tiles to the alignment list.
  *
  * Finally the tiles are extended inexactly until they
  * abutt each other, or until even inexact extension is
  * fruitless.  
  * 
  * The inexact extension is perhaps the trickiest part of the
  * algorithm.  It's implemented in expandLeft and expandRight.
  * In these the extension is first taken as far as it can go
  * exactly.  Then if four of the next five bases match it's
  * taken five bases further. Then a break is generated, and the
  * next significant match between the needle and haystack is
  * scanned for.
  */
 
-static char const rcsid[] = "$Id: fuzzyFind.c,v 1.18 2009/08/20 22:31:46 kent Exp $";
 
 #include "common.h"
 #include "dnautil.h"
 #include "localmem.h"
 #include "errabort.h"
 #include "fuzzyFind.h"
 #include "obscure.h"
 
 /* ffMemory routines - 
  *    FuzzyFinder allocates memory internally from the
  *    following routines, which allocate blocks from the
  *    main allocator and then dole them out.
  *
  *    At the end of fuzzy-finding, the actual alignment
  *    is copied to more permanent memory, and all the