## Replace or Update a Table Row – based on the presence of a matching row item

Unfortunately I know next to nothing about php coding that contains some sql code. The examples I have seen online do not seem to match the same syntax that I inherited with this code, which is making this task confusing for me.

I have a database table called "effort" that contains two columns:

Column 1 = ad  Column 2 = theEffort 

This line of code below works, and it will populate the table with the proper values for both the "ad" and "theEffort"

## SSL not working fine, Home url not matching with site url wordpress errors

I deployed WordPress through Bitnami so after adding an SSL certification I started getting warnings from my WordPress dashboard of my site URL not matching with Home URL I was directed to my WordPress settings To reset back to https://www.healthviewonfraweb.xyz instead of http but I saw that I could not do that on the my settings, I had to login my Myphpadmin to do it there but WP-OPTION still has the correct URL which is https://www.healthviewonfraweb.xyz but still not reflecting on my WordPress

My problem now is why is the URL on my WordPress General settings is http://www.healthviewonfraweb.xyz/ instead of https://www.healthviewonfraweb.xyz and still cannot be changed from there or why is the site URL on my wp-option not same with the one on my WordPress General settings.

Thank you

## Combinatorial Problem similar in nature to a special version of max weighted matching problem

I have a problem and want to know if there is any combinatorial optimization that is similar in nature to this problem or how to solve this special version of the max weight matching problem.

I have a general graph $$G(\mathcal{V},\mathcal{E},\mathcal{W})$$. I want to find a maximum weight matching of the graph $$G$$ that must cover a certain subset of vertices and has a specific size. For example, if I have a graph with eight vertices, I want to find a max weighted matching that must cover the subset of vertices $$\mathcal{V}’=\{1,2,3\}$$ and the size of the matching is $$\lceil{|\mathcal{V}’|/2}\rceil$$. So one more vertex needs to be chosen that maximizes the weighted matching. How to find the optimal solution in polynomial time if possible?

## Why Burrow’s Wheeler Matching (FM-Index) is favored for DNA read matching

I noticed that FM-indexing is a preferred way to match strings in large data sets, and in particular DNA sequencing wiki-article. I know that with this method, it can eliminate space dependencies thanks to compression methods. However, alternatives like Knuth-Morris-Pratt Algorithm or Rabin-karp are highly effective in terms of extra space complexity with $$O(|Pattern| + 1)$$ and $$O(1)$$ respectively. These, are the complexity that would take if I were to code them so there might be better ways.

Overall, Burrows-Wheeler transform doesn’t do all that much both in terms of time and space. So why is it favored? My current assumption is that it can be modified to do approximate pattern matching. Does that imply Rabin-karp or KMP cannot be modified to efficiently calculate approximate matches?