<?xml version='1.0'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:georss="http://www.georss.org/georss" xmlns:atom="http://www.w3.org/2005/Atom" >
<channel>
	<title><![CDATA[BOL: Related items]]></title>
	<link>https://bioinformaticsonline.com/related/29912?offset=1640</link>
	<atom:link href="https://bioinformaticsonline.com/related/29912?offset=1640" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</guid>
	<pubDate>Sat, 20 Sep 2025 09:34:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</link>
	<title><![CDATA[HiTE: a fast and accurate dynamic boundary adjustment approach for full-length Transposable Elements detection and annotation in Genome Assemblies]]></title>
	<description><![CDATA[<p dir="auto"><code>HiTE</code>&nbsp;is a Python software that uses a dynamic boundary adjustment approach to detect and annotate full-length Transposable Elements in Genome Assemblies. In comparison to other tools, HiTE demonstrates superior performance in detecting a greater number of full-length TEs.</p>
<div dir="auto">
<h2 dir="auto">panHiTE</h2>
<a href="https://github.com/CSU-KangHu/HiTE#panhite"></a></div>
<p dir="auto">We have developed panHiTE, a comprehensive and accurate pipeline for TE detection in large-scale population genomes. It has been successfully applied to hundreds of plant population genomes, demonstrating its effectiveness and scalability.</p>
<p dir="auto">For detailed instructions, please refer to the&nbsp;<a href="https://github.com/CSU-KangHu/HiTE/wiki/panHiTE-tutorial">panHiTE tutorial</a>.</p><p>Address of the bookmark: <a href="https://github.com/CSU-KangHu/HiTE" rel="nofollow">https://github.com/CSU-KangHu/HiTE</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/22393/narcis-fernandez-fuentes-lab</guid>
  <pubDate>Mon, 25 May 2015 07:30:00 -0500</pubDate>
  <link></link>
  <title><![CDATA[Narcis Fernandez-Fuentes Lab]]></title>
  <description><![CDATA[
<p>Welcome to our web-site compiling all the research-related activities of the group. Our research interests relate to a number of areas within Bioinformatics. We have a long-standing interest in protein structure prediction and structure-to-function relationships. We work in the study of biomolecular interactions, modeling of protein complexes, the study and characterization of protein-protein interactions, peptide design, modeling of genetic variation, structure-based protein design and different aspects of Plant Bioinformatics. Take a look at the our databases and servers and the list of publications for more information.</p>

<p>More at http://www.bioinsilico.org/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45273/a-subway-map-for-the-genome</guid>
	<pubDate>Fri, 04 Sep 2026 04:14:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45273/a-subway-map-for-the-genome</link>
	<title><![CDATA[A Subway Map for the Genome]]></title>
	<description><![CDATA[<p>Maya was looking at a genome graph on her computer. There were nodes, branches, and paths going in every direction.</p><p>&ldquo;It&rsquo;s like a subway map,&rdquo; she said, &ldquo;but for DNA.&rdquo;</p><p>That idea is exactly what Sequence Tube Map brings to life.</p><p>Instead of showing a genome as one long, confusing sequence, it displays different genomic paths like routes on a metro map. Where sequences are shared, the paths travel together. Where genetic variation occurs, they branch into different routes and may join again later.</p><p>This makes complex genome graphs much easier to explore.</p><p>Maya could now see how different haplotypes moved through the same genomic region and where they took different paths. She could even view sequencing reads mapped onto the graph, helping her understand what was happening in regions with genetic variation.</p><p>What once looked like a tangled network now looked like a journey.</p><p>Sequence Tube Map turns the complexity of graph genomes into a visual story&mdash;making it easier for scientists to see how DNA can take different routes.</p><p>Read more at&nbsp; https://github.com/vgteam/sequencetubemap&nbsp;</p><p>and</p><p>https://academic.oup.com/bioinformatics/article/35/24/5318/5542397</p><p>Demo at&nbsp;https://vgteam.github.io/sequenceTubeMap/</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22431/genomic-scientist-at-udsc</guid>
  <pubDate>Thu, 28 May 2015 19:14:23 -0500</pubDate>
  <link></link>
  <title><![CDATA[Genomic Scientist at UDSC]]></title>
  <description><![CDATA[
<p>Centre for Genetic Manipulation of Crop Plants</p>

<p>Department of Genetics</p>

<p>University of Delhi South Campus</p>

<p>NEW DELHI – 110 021</p>

<p>WALK-IN-INTERVIEW FOR THE TEMPORARY POSITIONS OF RESEACH SCIENTIT &amp; LAB / FIELD ATTENDANT</p>

<p>1 Research Scientist (RS) – 3</p>

<p>    DBT, Ph. D.</p>

<p>    Experience on DNA Markers, plant genome mapping and bioinformatics</p>

<p>    Salary: 60,000 (Consolidated) + 5% annual increment</p>

<p>    Date and time: 25.06.2015 at 10:30 AM</p>

<p>These temporary positions have been sanctioned in a DBT funded project for the Phase II on ‘Centre of Excellence on genome mapping and molecular breeding of Brassicas.’</p>

<p>The applicants are requested to register their names on the day of interview in the First Floor, Biotech Centre, Centre for Genetic Manipulation of Crop Plants, Department of Genetics before the stipulated time for the interview. Only the registered eligible candidates will be interviewed on the day in the Committee Room.</p>

<p>Applicants are requested to bring all related documents, in original and a set of photocopy, for verification.</p>

<p>No TA/DA will be paid for attending the interview.</p>

<p>Advertisement:</p>

<p>www.du.ac.in/du/index.php?mact=News,cntnt01,detail,0&amp;cntnt01articleid=5492&amp;cntnt01returnid=83</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45306/the-genes-that-travel-together-a-genomic-detective-story</guid>
	<pubDate>Fri, 11 Sep 2026 13:00:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45306/the-genes-that-travel-together-a-genomic-detective-story</link>
	<title><![CDATA[The Genes That Travel Together: A Genomic Detective Story]]></title>
	<description><![CDATA[<p>Imagine looking through thousands of microbial genomes and discovering two genes that repeatedly appear together. The obvious conclusion is that they must somehow be connected&mdash;that perhaps they work together, participate in the same pathway, or depend on each other. But evolution has a way of leaving misleading clues. What if these two genes are found together simply because they were inherited from the same ancient ancestor? In that case, their apparent association may have little to do with their biological function; it may simply be a reflection of shared evolutionary history. This is the intriguing problem addressed by CORGIAS (https://github.com/ynishimuraLv/corgias), a computational framework developed to distinguish genuine gene associations from correlations created by common ancestry.</p><p>Instead of asking only whether two genes occur together across genomes, CORGIAS asks a deeper question: did these genes actually evolve together, repeatedly gaining or losing their presence in concert, or are they merely travelling together because of their inherited history? The framework introduces two complementary approaches, Ancestral State Adjustment (ASA) and the Simultaneous EVolution test (SEV), which incorporate evolutionary information into the search for gene associations. This distinction becomes increasingly important as genome sequencing continues to uncover enormous numbers of microbial genomes, many from organisms that have never been cultured and whose genes remain functionally mysterious. In this growing genomic landscape, simply finding a gene is no longer enough&mdash;we need clues about what that gene might be doing. CORGIAS approaches this problem almost like a genomic detective: rather than treating every association as evidence, it reconstructs the evolutionary story behind the association and asks whether the evidence survives that history. By doing so, it offers a way to separate coincidence from biological connection and potentially uncover functional relationships hidden within the vast microbial genomic landscape. The broader message is beautifully simple: genes do not evolve in isolation, and understanding what they do may require us to look beyond where they are today and reconstruct how they arrived there. Sometimes, the most important clue in a genome is not the gene itself, but the evolutionary journey it has taken.</p><p>More at&nbsp;https://academic.oup.com/nargab/article/7/4/lqaf182/8377910?</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22432/walk-ins-for-jrf-ans-srf-post-in-assam-agricultural-university</guid>
  <pubDate>Thu, 28 May 2015 19:16:47 -0500</pubDate>
  <link></link>
  <title><![CDATA[Walk-ins for JRF ans SRF post in Assam Agricultural University]]></title>
  <description><![CDATA[
<p>Distributed Information Centre<br />Department of Agricultural Biotechnology<br />Assam Agricultural University<br />Jorhat – 785 013<br />Walk-in interview</p>

<p>(ABT/DIC/01/2014 (No. AAU/ABT/DIT/Advt. 01/2015/111 Dtd. 19-05-2015)</p>

<p>Walk in interview for the following position will be held on 6th June, 2015 at 10.00AM in the Office Chamber of the undersigned. Candidates may appear for the interview with bio-data, reprints / publication / thesis etc and passport size photographs, original and attested copies of all testimonials etc, which must be presented at the time of interview. The applicants may submit their resume in advance tomkmodi@aau.ac.in.</p>

<p>Research Associate</p>

<p>    Ph.D. in Biotechnology/ Bioinformatics. Or</p>

<p>    Masters degree in Biotechnology/Bioinformatics with minimum 3(three) years research experience</p>

<p>    Desirable : Experience in Bioinformatics as evidenced from published research</p>

<p>    Rs 36,000+HRA for the 1st two years and 38,000+HRA for the 3rd year.</p>

<p>Senior Research Fellow</p>

<p>    Master Degree in Biotechnology/ Bioinformatics. With 2 (two) years  Experience in Bioinformatics as evidenced from Course work/ Diploma/Published research</p>

<p>    Rs 28,000+HRA for NET qualified candidate/Professional degree holder</p>

<p>    Rs 18,000+HRA for non-NET qualified general degree holder</p>

<p>Junior Research Fellow</p>

<p>    Master Degree in Biotechnology/ Bioinformatics/Computer Science/Computer Application</p>

<p>    Desirable: Experience in Bioinformatics as evident from Course work/ Diploma/Published research</p>

<p>    Rs 25,000+HRA for NET qualified candidate/Professional degree holder</p>

<p>    Rs 16,000+HRA for non-NET qualified general degree holder</p>

<p>Note: Term and conditions will be as per the DBT, Govt of India guidelines.</p>

<p>Advertisement: http://14.139.222.145/classified/biotech46.html</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22512/srf-post-in-nehu-shillong</guid>
  <pubDate>Wed, 03 Jun 2015 13:15:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[SRF post in NEHU, Shillong]]></title>
  <description><![CDATA[
<p>Dept of Biochemistry <br />North-Eastern Hill University<br />(A University with Potential for Excellence) <br />Umshing, Shillong- 793 022</p>

<p>Applications are invited for the post of Senior Research Fellow- SRF (1) and Junior Research Fellow- JRF (1) to be appointed in a SERB-funded major research project entitled “Biochemical and functional properties of Synechocystis Glutathione S-transferase(s)” sanctioned to Dr. Timir Tripathi, Molecular and Structural Biophysics Laboratory, Department of Biochemistry, NEHU, Shillong. </p>

<p>Essential Qualifications: For both positions M.Sc. or equivalent with a good academic record is a prerequisite. </p>

<p>For Project-SRF, experience in bioinformatics/computational biology is required, which should be evident by atleast one good publication. </p>

<p>For JRF position, freshers can also apply. </p>

<p>Stipend: As per SERB norms. </p>

<p>Interested students can email their detailed bio-data including mobile number and recent photograph to msb.biochem@gmail.com, latest by 20.06.15. The hard copy is not required. The date of interview will be informed after primary scrutiny of the applications. No TA/DA will be paid if called for interview. For details of the research work of the PI’s group kindly visit www.ttripathi.webs.com</p>

<p>Advertisement: http://www.nehu.ac.in/Advertisements/BiochemSERB_Advt_020615.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38012/cosine-non-seeding-method-for-mapping-long-noisy-sequences</guid>
	<pubDate>Fri, 26 Oct 2018 00:41:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38012/cosine-non-seeding-method-for-mapping-long-noisy-sequences</link>
	<title><![CDATA[COSINE: non-seeding method for mapping long noisy sequences]]></title>
	<description><![CDATA[<p><span>Third generation sequencing (TGS) are highly promising technologies but the long and noisy reads from TGS are difficult to align using existing algorithms. Here, we present COSINE, a conceptually new method designed specifically for aligning long reads contaminated by a high level of errors.</span></p><p>Address of the bookmark: <a href="https://github.com/SUwonglab/COSINE" rel="nofollow">https://github.com/SUwonglab/COSINE</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/22569/reverse-complement-problem-solved-with-perl</guid>
	<pubDate>Tue, 09 Jun 2015 23:37:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/22569/reverse-complement-problem-solved-with-perl</link>
	<title><![CDATA[Reverse Complement Problem Solved with Perl]]></title>
	<description><![CDATA[<p>Question at http://rosalind.info/problems/1b/</p><p>#Find the reverse complement of a DNA string.<br />#Given: A DNA string Pattern.<br />#Return: Pattern, the reverse complement of Pattern.<br /><br />use strict;<br />use warnings;<br /><br />my $string="AAAACCCGGT";<br />my $finalString="";<br />my %hash = (<br />&nbsp;&nbsp; &nbsp;"C" =&gt; "G", <br />&nbsp;&nbsp; &nbsp;"A" =&gt; "T", <br />&nbsp;&nbsp; &nbsp;"T" =&gt; "A", <br />&nbsp;&nbsp; &nbsp;"G" =&gt; "C",<br />);<br /><br />for (my $aa=0; $aa&lt;=(length($string)-1); $aa++) {<br />&nbsp;&nbsp; &nbsp;my $char=substr $string, $aa, 1;<br />&nbsp;&nbsp; &nbsp;#print $hash{$char};<br />&nbsp;&nbsp; &nbsp;$finalString="$hash{$char}"."$finalString";<br />}<br /><br />print $finalString;<br />print "\n";</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22580/appointment-of-two-traineeships-and-two-studentships-in-bioinformatics</guid>
  <pubDate>Wed, 10 Jun 2015 10:19:07 -0500</pubDate>
  <link></link>
  <title><![CDATA[Appointment of two traineeships and two studentships in Bioinformatics]]></title>
  <description><![CDATA[
<p>Jawaharlal Nehru<br />TROPICAL BOTANIC GARDEN AND RESEARCH INSTITUTE<br />An organization under the Kerala State Council for Science, Technology and Environment and<br />National Centre of Excellence, Government of India<br /> <br />Applications are invited for the appointment of two traineeships and two studentships in Bioinformatics for a period of six months sponsored by Department of Biotechnology, Government of India in the Bioinformatics Sub-DIC, Saraswathy Thangavelu Centre, JNTBGRI, Puthenthope, Thiruvananthapuram 695 586. The required qualifications and other details are given below.</p>

<p>Monthly fellowship (in rupee): 5,000/-<br />	<br />Traineeship<br />	<br />First Class M.Sc Bioinformatics/ Biotechnology/ Botany<br />	<br />Studentship: 5,000/-<br />	<br />M.Phil/M.Tech Bioinformatics/ Biotechnology/ any branch of Life Science students for doing their thesis work in the area of Bioinformatics.</p>

<p>Age limit as on 1.1.2015, 28 years. Age relaxation will be provided for SC, ST, OBC candidates as per Govt. norms.</p>

<p>Interested candidates may appear for walk-in-interview on 16th June 2015 at 10.30 am at JNTBGRI, Palode, Thiruvananthapuram. The candidate should report to the Office at Palode before 10.00 am</p>

<p>More at http://www.jntbgri.in/jntbgri/news/File0001.pdf</p>
]]></description>
</item>

</channel>
</rss>