<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Thesis | Raihanul Alam Hridoy</title><link>https://hridoy100.github.io/tags/thesis/</link><atom:link href="https://hridoy100.github.io/tags/thesis/index.xml" rel="self" type="application/rss+xml"/><description>Thesis</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Mon, 09 Nov 2020 00:00:00 +0000</lastBuildDate><image><url>https://hridoy100.github.io/media/icon_hu5857248767785312555.png</url><title>Thesis</title><link>https://hridoy100.github.io/tags/thesis/</link></image><item><title>Undergraduate Thesis Defended</title><link>https://hridoy100.github.io/event/undergrad-thesis/</link><pubDate>Mon, 09 Nov 2020 00:00:00 +0000</pubDate><guid>https://hridoy100.github.io/event/undergrad-thesis/</guid><description>&lt;p>Successfully completed and defended my &lt;strong>undergraduate thesis&lt;/strong>, &lt;em>&amp;ldquo;On the Maximum Greedy Consensus Tree Problem&amp;rdquo;&lt;/em>, at the &lt;strong>Department of Computer Science and Engineering, BUET&lt;/strong>. The work proposed a heuristic for the Maximum Greedy Consensus Tree Problem in phylogenetics.&lt;/p></description></item></channel></rss>