<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
<channel>
<title>GATE Overflow for GATE BT - Questions without answers in Bioinformatics</title>
<link>https://bt.gateoverflow.in/unanswered/general-biology/bioinformatics</link>
<description>Powered by Question2Answer</description>
<item>
<title>GATE BT 2026 | Question: 20</title>
<link>https://bt.gateoverflow.in/1301/gate-bt-2026-question-20</link>
<description>&lt;p&gt;BLAST and its extensions can be used to determine similarity of a query protein sequence with which of the following database(s)?&lt;/p&gt;&lt;ol style=&quot;list-style-type:upper-alpha&quot;&gt;&lt;li&gt;A database of translated nucleotide sequences&lt;/li&gt;&lt;li&gt;A database of binding ligands and small translated peptides&lt;/li&gt;&lt;li&gt;A database of protein structures&lt;/li&gt;&lt;li&gt;A database of binding, linking and self-assembling proteins&lt;/li&gt;&lt;/ol&gt;</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/1301/gate-bt-2026-question-20</guid>
<pubDate>Mon, 23 Feb 2026 14:21:39 +0000</pubDate>
</item>
<item>
<title>GATE BT 2025 | Question: 37</title>
<link>https://bt.gateoverflow.in/1042/gate-bt-2025-question-37</link>
<description>&lt;p&gt;​​​​Correctly match the following &lt;strong&gt;Bioinformatic tool/Database &lt;/strong&gt;with its respective &lt;strong&gt;Utility&lt;/strong&gt;.&lt;/p&gt;

&lt;p&gt;\begin{array}{|l|l|}&lt;br&gt;
\hline&amp;nbsp;\textbf{Bioinformatic tool/Database} &amp;amp; \textbf{Utility} \\&lt;br&gt;
\hline&amp;nbsp;\text{P. BLAST} &amp;amp; 1. \text{Database for 3D protein structures} \\&lt;br&gt;
\hline&amp;nbsp;\text{Q. Bowtie} &amp;amp; 2. \text{Tool to identify similarity of a query} \\ &amp;amp; \text{sequence to existing sequences} \\ &amp;amp; \text{ available&amp;nbsp;in databanks}&amp;nbsp;\\&lt;br&gt;
\hline&amp;nbsp;\text{R. AlphaFold} &amp;amp;&amp;nbsp;3. \text{Tool to align short read DNA sequences} \\ &amp;amp;&lt;br&gt;
\text{obtained from Next-generation} \\ &amp;amp; \text{sequencing to a reference genome} \\&lt;br&gt;
\hline&amp;nbsp;\text{S. PDB} &amp;amp; 4. \text{AI tool to predict protein structures} \\ &amp;nbsp;\hline&lt;br&gt;
\end{array}&lt;/p&gt;

&lt;ol start=&quot;1&quot; style=&quot;list-style-type:upper-alpha&quot;&gt;
	&lt;li&gt;$\mathrm{P}-2 ; \mathrm{Q}-3 ; \mathrm{R}-1 ; \mathrm{S}-4$&lt;/li&gt;
	&lt;li&gt;$\mathrm{P}-2 ; \mathrm{Q}-3 ; \mathrm{R}-4 ; \mathrm{S}-1$&lt;/li&gt;
	&lt;li&gt;$\mathrm{P}-3 ; \mathrm{Q}-2 ; \mathrm{R}-4 ; \mathrm{S}-1$&lt;/li&gt;
	&lt;li&gt;$\mathrm{P}-4 ; \mathrm{Q}-1 ; \mathrm{R}-2 ; \mathrm{S}-3$&lt;/li&gt;
&lt;/ol&gt;</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/1042/gate-bt-2025-question-37</guid>
<pubDate>Thu, 06 Mar 2025 17:05:00 +0000</pubDate>
</item>
<item>
<title>GATE BT 2023 | Question: 16</title>
<link>https://bt.gateoverflow.in/883/gate-bt-2023-question-16</link>
<description>&lt;p&gt;Which one of the following programs is used for finding distantly related (or remote) protein homologs?&lt;/p&gt;

&lt;ol style=&quot;list-style-type:upper-alpha&quot;&gt;
	&lt;li&gt;BLASTN&lt;/li&gt;
	&lt;li&gt;BLASTX&lt;/li&gt;
	&lt;li&gt;PSI-BLAST&lt;/li&gt;
	&lt;li&gt;TBLASTX
	&lt;p&gt;&amp;nbsp;&lt;/p&gt;
	&lt;/li&gt;
&lt;/ol&gt;</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/883/gate-bt-2023-question-16</guid>
<pubDate>Sun, 21 May 2023 02:58:38 +0000</pubDate>
</item>
<item>
<title>GATE BT 2023 | Question: 17</title>
<link>https://bt.gateoverflow.in/882/gate-bt-2023-question-17</link>
<description>&lt;p&gt;Which one of the following is used for global alignment of two protein sequences?&lt;/p&gt;

&lt;ol style=&quot;list-style-type:upper-alpha&quot;&gt;
	&lt;li&gt;Chou-Fasman method&lt;/li&gt;
	&lt;li&gt;Garnier-Osguthorpe-Robson (GOR) method&lt;/li&gt;
	&lt;li&gt;Needleman-Wunsch algorithm&lt;/li&gt;
	&lt;li&gt;Smith-Waterman algorithm
	&lt;p&gt;&amp;nbsp;&lt;/p&gt;
	&lt;/li&gt;
&lt;/ol&gt;</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/882/gate-bt-2023-question-17</guid>
<pubDate>Sun, 21 May 2023 02:58:37 +0000</pubDate>
</item>
<item>
<title>GATE BT 2022 | Question: 14</title>
<link>https://bt.gateoverflow.in/816/gate-bt-2022-question-14</link>
<description>&lt;p&gt;Which of the following is $\text{NOT}$ used for generating an optimal alignment of two nucleotide sequences?&lt;/p&gt;

&lt;ol start=&quot;1&quot; style=&quot;list-style-type:upper-alpha&quot;&gt;
	&lt;li&gt;Gap penalties&lt;/li&gt;
	&lt;li&gt;Match scores&lt;/li&gt;
	&lt;li&gt;Mismatch scores&lt;/li&gt;
	&lt;li&gt;Nucleotide composition&lt;/li&gt;
&lt;/ol&gt;</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/816/gate-bt-2022-question-14</guid>
<pubDate>Sun, 20 Mar 2022 16:16:29 +0000</pubDate>
</item>
<item>
<title>GATE BT 2022 | Question: 34</title>
<link>https://bt.gateoverflow.in/796/gate-bt-2022-question-34</link>
<description>&lt;p&gt;The maximum parsimony method is used to construct a phylogenetic tree for a set of sequences. Which one of the following statements about the method is $\text{CORRECT}?$&lt;/p&gt;

&lt;ol start=&quot;1&quot; style=&quot;list-style-type:upper-alpha&quot;&gt;
	&lt;li&gt;It predicts the tree that minimizes the steps required to generate the observed variations&lt;/li&gt;
	&lt;li&gt;It predicts the tree that maximizes the steps required to generate the observed variations&lt;/li&gt;
	&lt;li&gt;It predicts the tree with the least number of branch points&lt;/li&gt;
	&lt;li&gt;It employs probability calculations to identify the tree&lt;/li&gt;
&lt;/ol&gt;</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/796/gate-bt-2022-question-34</guid>
<pubDate>Sun, 20 Mar 2022 16:16:27 +0000</pubDate>
</item>
<item>
<title>GATE BT 2021 | Question: 3</title>
<link>https://bt.gateoverflow.in/749/gate-bt-2021-question-3</link>
<description>&lt;p&gt;Number of unrooted trees in a phylogeny of five sequences is&lt;/p&gt;

&lt;ol style=&quot;list-style-type:upper-alpha&quot; type=&quot;A&quot;&gt;
	&lt;li&gt;$3$&lt;/li&gt;
	&lt;li&gt;$15$&lt;/li&gt;
	&lt;li&gt;$105$&lt;/li&gt;
	&lt;li&gt;$945$&lt;/li&gt;
&lt;/ol&gt;</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/749/gate-bt-2021-question-3</guid>
<pubDate>Mon, 01 Mar 2021 03:19:51 +0000</pubDate>
</item>
<item>
<title>GATE BT 2021 | Question: 4</title>
<link>https://bt.gateoverflow.in/748/gate-bt-2021-question-4</link>
<description>&lt;p&gt;Which one of the following methods is used to test the significance of a predicted phylogeny?&lt;/p&gt;

&lt;ol style=&quot;list-style-type:upper-alpha&quot; type=&quot;A&quot;&gt;
	&lt;li&gt;Bootstrap&lt;/li&gt;
	&lt;li&gt;Maximum likelihood&lt;/li&gt;
	&lt;li&gt;Maximum parsimony&lt;/li&gt;
	&lt;li&gt;Minimum evolution&lt;/li&gt;
&lt;/ol&gt;</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/748/gate-bt-2021-question-4</guid>
<pubDate>Mon, 01 Mar 2021 03:19:51 +0000</pubDate>
</item>
<item>
<title>GATE BT 2021 | Question: 32</title>
<link>https://bt.gateoverflow.in/720/gate-bt-2021-question-32</link>
<description>&lt;p&gt;Which one of the following tools is used to compare all the possible six-open reading frames of a given nucleotide&amp;nbsp;query sequence with all the available six-open reading frames of the nucleotide sequence database?&lt;/p&gt;

&lt;ol style=&quot;list-style-type:upper-alpha&quot; type=&quot;A&quot;&gt;
	&lt;li&gt;$\text{BLASTN}$&lt;/li&gt;
	&lt;li&gt;$\text{BLASTX}$&lt;/li&gt;
	&lt;li&gt;$\text{TBLASTN}$&lt;/li&gt;
	&lt;li&gt;$\text{TBLASTX}$&lt;/li&gt;
&lt;/ol&gt;</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/720/gate-bt-2021-question-32</guid>
<pubDate>Mon, 01 Mar 2021 03:19:48 +0000</pubDate>
</item>
<item>
<title>GATE2019: 29</title>
<link>https://bt.gateoverflow.in/680/gate2019-29</link>
<description>&lt;p&gt;Which of the following statements are $CORRECT$ when a protein sequence database is searched using the $BLAST$ algorithm?&lt;/p&gt;

&lt;ol start=&quot;16&quot; style=&quot;list-style-type:upper-alpha&quot; type=&quot;A&quot;&gt;
	&lt;li&gt;A larger E-value indicates higher sequence similarity&lt;/li&gt;
	&lt;li&gt;E-value $&amp;lt;10^{-10}$ indicates sequence homology&lt;/li&gt;
	&lt;li&gt;A higher BLAST score indicates higher sequence similarity&lt;/li&gt;
	&lt;li&gt;E-value&amp;nbsp;$&amp;gt;10^{10}$ indicates sequence homology&lt;/li&gt;
&lt;/ol&gt;

&lt;ol style=&quot;list-style-type:upper-alpha&quot; type=&quot;A&quot;&gt;
	&lt;li&gt;$P, Q$ and $R$ only&lt;/li&gt;
	&lt;li&gt;$Q$ and $R$ only&lt;/li&gt;
	&lt;li&gt;$P, R$ and $S$ only&lt;/li&gt;
	&lt;li&gt;$P$ and $S$ only&lt;/li&gt;
&lt;/ol&gt;</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/680/gate2019-29</guid>
<pubDate>Tue, 03 Nov 2020 12:03:23 +0000</pubDate>
</item>
<item>
<title>GATE2020: 43</title>
<link>https://bt.gateoverflow.in/616/gate2020-43</link>
<description>The sequence of a $1$ $Mb$ long $DNA$ is random. This $DNA$ has all four bases occurring in equal proportion. The number of nucleotides, on average, between two successive $EcoRI$ recognition site $GAATTC$ is ____________.</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/616/gate2020-43</guid>
<pubDate>Tue, 03 Nov 2020 11:14:30 +0000</pubDate>
</item>
<item>
<title>GATE2019: 4</title>
<link>https://bt.gateoverflow.in/525/gate2019-4</link>
<description>&lt;p&gt;Which one of the following is a database of protein&amp;nbsp;sequence motifs?&lt;/p&gt;

&lt;ol style=&quot;list-style-type:upper-alpha&quot; type=&quot;A&quot;&gt;
	&lt;li&gt;$PROSITE$&lt;/li&gt;
	&lt;li&gt;$TrEMBL$&lt;/li&gt;
	&lt;li&gt;$SWISSPROT$&lt;/li&gt;
	&lt;li&gt;$PDB$&lt;/li&gt;
&lt;/ol&gt;</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/525/gate2019-4</guid>
<pubDate>Tue, 03 Nov 2020 04:04:45 +0000</pubDate>
</item>
<item>
<title>GATE2019: 19</title>
<link>https://bt.gateoverflow.in/510/gate2019-19</link>
<description>The number of possible rooted trees in a phylogeny of three species is ______.</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/510/gate2019-19</guid>
<pubDate>Tue, 03 Nov 2020 04:04:44 +0000</pubDate>
</item>
<item>
<title>GATE2016-8</title>
<link>https://bt.gateoverflow.in/438/gate2016-8</link>
<description>&lt;p&gt;Which one of the following is NOT an algorithm for building phylogenetic trees?&lt;/p&gt;

&lt;ol style=&quot;list-style-type:upper-alpha&quot;&gt;
	&lt;li&gt;Maximum parsimony&lt;/li&gt;
	&lt;li&gt;Neighbor joining&lt;/li&gt;
	&lt;li&gt;Maximum likelihood&lt;/li&gt;
	&lt;li&gt;Bootstrap&lt;/li&gt;
&lt;/ol&gt;</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/438/gate2016-8</guid>
<pubDate>Mon, 26 Mar 2018 16:59:52 +0000</pubDate>
</item>
<item>
<title>GATE BT 2015 | Question: 26</title>
<link>https://bt.gateoverflow.in/300/gate-bt-2015-question-26</link>
<description>&lt;p&gt;Identify the file format given below:&lt;/p&gt;

&lt;p&gt;$&amp;gt;$P$1$; JMFD&lt;/p&gt;

&lt;p&gt;Protein X –&amp;nbsp;&lt;em&gt;Homo sapiens&lt;/em&gt;&lt;/p&gt;

&lt;p&gt;MKALTARQQEVFDLIRDHISRTLRQQGDWL&lt;/p&gt;

&lt;ol style=&quot;list-style-type:upper-alpha&quot;&gt;
	&lt;li&gt;GDE&lt;/li&gt;
	&lt;li&gt;FASTA&lt;/li&gt;
	&lt;li&gt;NBRF&lt;/li&gt;
	&lt;li&gt;GCG&lt;/li&gt;
&lt;/ol&gt;</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/300/gate-bt-2015-question-26</guid>
<pubDate>Mon, 26 Mar 2018 15:10:48 +0000</pubDate>
</item>
<item>
<title>GATE BT 2015 | Question: 37</title>
<link>https://bt.gateoverflow.in/289/gate-bt-2015-question-37</link>
<description>&lt;p&gt;How many rooted and unrooted phylogenetic trees, respectively, are possible with four different sequences?&lt;/p&gt;

&lt;ol style=&quot;list-style-type:upper-alpha&quot; type=&quot;A&quot;&gt;
	&lt;li&gt;$3$ and $15$&lt;/li&gt;
	&lt;li&gt;$15$ and $3$&lt;/li&gt;
	&lt;li&gt;$15$ and $12$&lt;/li&gt;
	&lt;li&gt;$12$ and $3$&lt;/li&gt;
&lt;/ol&gt;</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/289/gate-bt-2015-question-37</guid>
<pubDate>Mon, 26 Mar 2018 15:10:46 +0000</pubDate>
</item>
<item>
<title>GATE BT 2015 | Question: 53</title>
<link>https://bt.gateoverflow.in/273/gate-bt-2015-question-53</link>
<description>Consider the following multiple sequence alignment of four DNA sequences.&lt;br /&gt;
&lt;br /&gt;
$$\begin{array}{cccc} A &amp;amp; C &amp;amp; T &amp;amp; A &amp;nbsp;\\ A &amp;amp; C &amp;amp; T &amp;amp; G \\ A &amp;amp; G &amp;amp; T &amp;amp; C \\ A &amp;amp; G &amp;amp; C &amp;amp; T \end{array}$$Shannon&amp;#039;s entropy of the above alignment is ___________</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/273/gate-bt-2015-question-53</guid>
<pubDate>Mon, 26 Mar 2018 15:10:44 +0000</pubDate>
</item>
<item>
<title>GATE2014-22</title>
<link>https://bt.gateoverflow.in/229/gate2014-22</link>
<description>&lt;p&gt;&amp;nbsp;The algorithm for BLAST is based on&lt;/p&gt;

&lt;ol style=&quot;list-style-type:upper-alpha&quot;&gt;
	&lt;li&gt;Dynamic Programming&lt;/li&gt;
	&lt;li&gt;Hidden Markov Model&lt;/li&gt;
	&lt;li&gt;k-tuple analysis&lt;/li&gt;
	&lt;li&gt;Neural Network&lt;/li&gt;
&lt;/ol&gt;</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/229/gate2014-22</guid>
<pubDate>Sun, 25 Mar 2018 23:27:39 +0000</pubDate>
</item>
<item>
<title>GATE2014-43</title>
<link>https://bt.gateoverflow.in/208/gate2014-43</link>
<description>In an affine gap penalty model, if the gap opening penalty &amp;nbsp;$-20$, gap extension penalty is $-4$ and gap length is $8$, the gap score is__________.</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/208/gate2014-43</guid>
<pubDate>Sun, 25 Mar 2018 23:27:36 +0000</pubDate>
</item>
<item>
<title>GATE BT 2013 | Question: 36</title>
<link>https://bt.gateoverflow.in/166/gate-bt-2013-question-36</link>
<description>&lt;p&gt;Determine the correctness or otherwise of the following $\text{Assertion (a) and Reason (r)}$.&lt;/p&gt;

&lt;p&gt;$\text{Assertion:}$ $\text{UPGMA}$ method produces ultrametric tree.&lt;/p&gt;

&lt;p&gt;$\text{Reason:}$ Sequence alignment is converted into evolutionary distances in $\text{UPGMA}$ method.&lt;/p&gt;

&lt;ol style=&quot;list-style-type:upper-alpha&quot;&gt;
	&lt;li&gt;Both $(a)$ and $(r)$ are true and $(r)$ is the correct reason for $(a)$&lt;/li&gt;
	&lt;li&gt;Both $(a)$ and $(r)$ are true and $(r)$ is not the correct reason for $(a)$&lt;/li&gt;
	&lt;li&gt;$(a)$ is true but $(r)$ is false&lt;/li&gt;
	&lt;li&gt;$(a)$ is false but $(r)$ is true&lt;/li&gt;
&lt;/ol&gt;</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/166/gate-bt-2013-question-36</guid>
<pubDate>Sun, 25 Mar 2018 20:06:01 +0000</pubDate>
</item>
<item>
<title>GATE BT 2013 | Question: 24</title>
<link>https://bt.gateoverflow.in/154/gate-bt-2013-question-24</link>
<description>Calculate the percentage sequence identity for the pairwise alignment given below. ______________&lt;br /&gt;
&lt;br /&gt;
$\text{HELLO-}$&lt;br /&gt;
$\text{YELLOW}$</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/154/gate-bt-2013-question-24</guid>
<pubDate>Sun, 25 Mar 2018 20:05:59 +0000</pubDate>
</item>
<item>
<title>GATE BT 2012 | Question: 22</title>
<link>https://bt.gateoverflow.in/87/gate-bt-2012-question-22</link>
<description>&lt;p&gt;While searching a database for similar sequences, E value does NOT depend on the&lt;/p&gt;

&lt;ol style=&quot;list-style-type:upper-alpha&quot;&gt;
	&lt;li&gt;sequence length&lt;/li&gt;
	&lt;li&gt;number of sequences in the database&lt;/li&gt;
	&lt;li&gt;scoring system&lt;/li&gt;
	&lt;li&gt;probability from a normal distribution&lt;/li&gt;
&lt;/ol&gt;</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/87/gate-bt-2012-question-22</guid>
<pubDate>Sun, 25 Mar 2018 08:38:44 +0000</pubDate>
</item>
<item>
<title>GATE BT 2012 | Question: 19</title>
<link>https://bt.gateoverflow.in/84/gate-bt-2012-question-19</link>
<description>&lt;p&gt;An example of a derived protein structure database is&lt;/p&gt;

&lt;ol style=&quot;list-style-type:upper-alpha&quot;&gt;
	&lt;li&gt;Pfam&lt;/li&gt;
	&lt;li&gt;SCOP&lt;/li&gt;
	&lt;li&gt;GEO&lt;/li&gt;
	&lt;li&gt;Prosite&lt;/li&gt;
&lt;/ol&gt;</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/84/gate-bt-2012-question-19</guid>
<pubDate>Sun, 25 Mar 2018 08:38:43 +0000</pubDate>
</item>
<item>
<title>GATE BT 2012 | Question: 20</title>
<link>https://bt.gateoverflow.in/85/gate-bt-2012-question-20</link>
<description>&lt;p&gt;An example of a program for constructing a phylogenetic tree is&lt;/p&gt;

&lt;ol style=&quot;list-style-type:upper-alpha&quot;&gt;
	&lt;li&gt;phylip&lt;/li&gt;
	&lt;li&gt;phrap&lt;/li&gt;
	&lt;li&gt;prodom&lt;/li&gt;
	&lt;li&gt;PHDsec&lt;/li&gt;
&lt;/ol&gt;</description>
<category>Bioinformatics</category>
<guid isPermaLink="true">https://bt.gateoverflow.in/85/gate-bt-2012-question-20</guid>
<pubDate>Sun, 25 Mar 2018 08:38:43 +0000</pubDate>
</item>
</channel>
</rss>