From d8cb52fba904cfa4fde10f6ff6736cf2363f832e Mon Sep 17 00:00:00 2001
From: rvaser <robert.vaser@fer.hr>
Date: Tue, 31 Oct 2017 09:19:45 +0100
Subject: [PATCH] Updated README and fixed compilation bug

---
 README.md                      | 4 ++--
 sift4g/src/database_search.cpp | 3 ++-
 2 files changed, 4 insertions(+), 3 deletions(-)

diff --git a/README.md b/README.md
index 1a98be5..430cb22 100644
--- a/README.md
+++ b/README.md
@@ -3,7 +3,7 @@
 SIFT (Sorting Intolerant From Tolerant) For Genomes (http://www.nature.com/nprot/journal/v11/n1/full/nprot.2015.123.html)
 
 ## Requirements
-- g++ (4.8+)
+- g++ (4.9+)
 - GNU Make
 - nvcc (2.\*+) (optional)
 
@@ -41,7 +41,7 @@ where both the query and database files are protein sequences in fasta format.
 To see all available parameters run the command bellow:
 
     ./bin/sift4g -h
-    
+
 ## Check installation
 
 To test sift4g, go to the [test_files directory](test_files/) and follow directions in [README](test_files/README.md)
diff --git a/sift4g/src/database_search.cpp b/sift4g/src/database_search.cpp
index 155aea3..29d8541 100644
--- a/sift4g/src/database_search.cpp
+++ b/sift4g/src/database_search.cpp
@@ -8,6 +8,7 @@
 
 #include <algorithm>
 #include <limits>
+#include <cmath>
 
 #include "hash.hpp"
 #include "utils.hpp"
@@ -261,7 +262,7 @@ int32_t longestIncreasingSubsequence(const std::vector<int32_t>& src) {
         u = src.size();
 
         while (u > l) {
-            temp = floor((l + u) / 2.0f);
+            temp = std::floor((l + u) / 2.0f);
             if (help[temp] < src[i]) {
                 l = temp + 1;
             } else {