1. Fixed bug in BamAncillary::getBamBlocks where the switch statement was misbehaving.  Changed to if/else
	2. Added countSplitHits to bedFile class to proper count coverage from "blocked" alignments. Previously, coverage
           was counted separately for __each__ block yet what we actually want is the base coverage to be counted for each block,
           but we only want the blocks to be treated as __one__ alignment or feature.
	3. Updated coverageBed to use getBamBlocks.

	1.  Added support for VCF 4.0.  BED.end is based on the size of the REF allele in the VCF entry.
	2.  Fixed a bug in BamReader.cpp that bombed when seq and qual are == "*"
	3.  Changed the Makefiles to inherit flags from the master Makefile in the root directory.
	4.  Fixed a bug in bedToBam to created incorrect CIGAR strings for the first block.

	1. Created separate structs for BED and BEDCOV in order to reduce memory consumption.  Savings of ~30%.
	2. Changed the binning approach to make 16kb bins the most granular.  IntersectBed is now 1/3 faster as a result.
	3. Templated the parsing and reporting functions in bedFile.  Had to move them to the header file to avoid linker complications.
	4. Added CHRPOS as a common type.

	Open and Close were omitted by mistake.

	1. Updated intersectBed, coverageBed and genomeCoverageBed to correctly compute alignment end coordinates in BAM.
	2. Changed the logic for handling BAM alignments in pairToBed
	3. Allowed the use of minMappingQuality or totalEdit distance in pairToBed.

	1. Added the -hist option (credit to Jose Bras).
	2. Substantially improved the speed by using a depth iterator instead of copying the depth map for each feature in B when computing coverage.

	1. Revised usage to 80 chars
	2. GPL headers
	3. Added new stdin logic
	4. Changes logo.
	5. Updated bedFile.cpp's loadBedIntoMapBin to support stdin.

	1. Got parseGffLine working
	2. Added GFF support to the reportBed* methods.
	3. Cleaned up the stdin / parsing logic and centralized it within bedFile.cpp.
	This removes some of the complexity from each of the tools and tidies the codebase
	overall.

	Ready for publication release.
	Checked all of the help messages.
	Cleaned up some inconsistencies.

=== Notable changes in this release ===
1.  coverageBed will optionally only count features in BED file A (e.g. sequencing reads) that overlap with
	the intervals/windows in BED file B.  This has been requested several times recently and facilitates CHiP-Seq and
	RNA-Seq experiments.

2.  intersectBed can now require a minimum __reciprocal__ overlap between intervals in BED A and BED B.  For example,
	previously, if one used -f 0.90, it required that a feature in B overlap 90% of the feature in A for the "hit"
	to be reported.  If one adds the -r (reciprocal) option, the hit must also cover 90% of the feature in B.  This helps
	to exclude overlaps between say small features in A and large features in B:

	A ==========
	B  **********************************************************

	-f 0.50 (Reported), whereas -f 0.50 -r (Not reported)

3.  The score field has been changed to be a string.  While this deviates from the UCSC definition, it allows one to track
	much more meaningful information about a feature/interval.  For example, score could now be:

	7.31E-05  (a p-value)
	0.334577  (mean enrichment)
	2:2.2:40:2 (several values encoded in a string)

4.  closestBed now, by default, reports __all__ intervals in B that overlap equally with an interval in A.  Previously, it
	merely reported the first such feature that appeared in B.  Here's a cartoon explaining the difference.

	**Prior behavior**

	A	 ==============
	B.1        				++++++++++++++
	B.2       				++++++++++++++
	B.3               				+++++++++

	-----------------------------------------
	Result = B.1 			++++++++++++++

	**Current behavior**

	A	 ==============
	B.1        				++++++++++++++
	B.2       				++++++++++++++
	B.3               				+++++++++

	-----------------------------------------
	Result = B.1 			++++++++++++++
			 B.2 			++++++++++++++

	Using the -t option, one can also choose to report either the first or the last entry in B in the event of a tie.

5.  Several other minor changes to the algorithms have been made to increase speed a bit.

1. Fixed yet another bug in the parsing of "track" or "browser" lines.  Sigh...
2. Change the "score" column (i.e. column 5) to b stored as a string.  While this deviates
   from the UCSC convention, it allows significantly more information to be packed into the column.

	1. Fixed a bug in peIntersectBed that prevented -a from being correctly handled when passed via stdin.
	2. Added new functionality to coverageBed that calculates the density of coverage.
	3. Fixed bug in genomeCoverageBed.

	1. Added strandedness to relevant programs (e.g. intersectBed, mergeBed, etc.)
	2. Moved reportBed and reportBedRange to bedFile.cpp to clean up code
	3. Sped up file parsing.  Added lineFileUtilities.cpp
	4. Added peIntersectBed

	1.  Added a README for installation
	2.  Modified intersectBed and windowBed to call one function for
	    finding overlaps.  This function is now called when reading
	    from cin or from a file.
	3.  Added acknowledgements.
	4.  Corrected the PROGRAM_NAME in coverageBed

	Changed the include from graphBed.h to coverageBed.h
coverageMain.cpp:
        Changed the include from graphBed.h to coverageBed.h