diff --git a/alib2algo/src/arbology/exact/DeadZoneUsingBadCharacterShiftAndBorderArray.h b/alib2algo/src/arbology/exact/DeadZoneUsingBadCharacterShiftAndBorderArray.h
index ab63924469730703e5a3043d85249639e1593d7b..1317cb8275f98e8148b0124f787390ce726fd936 100644
--- a/alib2algo/src/arbology/exact/DeadZoneUsingBadCharacterShiftAndBorderArray.h
+++ b/alib2algo/src/arbology/exact/DeadZoneUsingBadCharacterShiftAndBorderArray.h
@@ -10,15 +10,12 @@
 
 #include <set>
 #include <vector>
-#include <core/multipleDispatch.hpp>
-#include <tree/TreeFeatures.h>
 #include <alphabet/RankedSymbol.h>
 
 #include <tree/properties/ReversedBadCharacterShiftTable.h>
 #include <tree/properties/BorderArrayNaive.h>
 #include <tree/properties/SubtreeJumpTable.h>
 
-#include <tree/Tree.h>
 #include <tree/ranked/PrefixRankedBarTree.h>
 #include <tree/ranked/PrefixRankedBarPattern.h>
 #include <tree/ranked/PrefixRankedTree.h>
@@ -34,7 +31,7 @@ namespace exact {
 /**
  * Implementation of DeadZone matching using bad character shift as shifting method on one direction and border array on the other
  */
-class DeadZoneUsingBadCharacterShiftAndBorderArray : public alib::DoubleDispatch < DeadZoneUsingBadCharacterShiftAndBorderArray, ext::set < unsigned >, const tree::TreeBase &, const tree::TreeBase & > {
+class DeadZoneUsingBadCharacterShiftAndBorderArray {
 public:
 	/**
 	 * Search for pattern in linear string.