<?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/31139?offset=250</link>
	<atom:link href="https://bioinformaticsonline.com/related/31139?offset=250" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43711/vcf-compare</guid>
	<pubDate>Wed, 19 Jan 2022 10:30:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43711/vcf-compare</link>
	<title><![CDATA[VCF Compare !]]></title>
	<description><![CDATA[<h2><span>compare two&nbsp;<strong>BWA</strong>&nbsp;mapping methods with the online hg18-mapped data</span></h2>
<p>We first operate a rapid inspection of the different BAM files using&nbsp;<strong>samtools flagstat</strong>. Illumina provided chr21 read mapping obtained with their&nbsp;<strong>GA IIx</strong>&nbsp;deep sequencing platform &lt;<a href="ftp://webdata:webdata@ussd-ftp.illumina.com/Data/SequencingRuns/NA18507_GAIIx_100_chr21.bam" target="_blank">ftp://webdata:webdata@ussd-ftp.illumina.com/Data/SequencingRuns/NA18507_GAIIx_100_chr21.bam</a>&gt;, aligned to the b36/hg18 reference genome)</p><p>Address of the bookmark: <a href="https://wiki.bits.vib.be/index.php/NGS_Exercise.6#compare_aln_.26_mem_results_with_vcf-compare" rel="nofollow">https://wiki.bits.vib.be/index.php/NGS_Exercise.6#compare_aln_.26_mem_results_with_vcf-compare</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/11528/post-doctoral-research-assistant-in-genetics</guid>
  <pubDate>Thu, 05 Jun 2014 16:01:39 -0500</pubDate>
  <link></link>
  <title><![CDATA[Post-doctoral Research Assistant in Genetics]]></title>
  <description><![CDATA[
<p>Post-doctoral Research Assistant in Genetics<br />Camden, North London<br />£31.1K per annum inclusive of London Weighting</p>

<p>This is a fixed term post for 36 months.</p>

<p>We wish to recruit a highly motivated, postdoctoral scientist to carry out a BBSRC funded project in the laboratory of Dr. Denis Larkin. The project is focused on developing and applying new algorithms to study genome and chromosome evolution in birds, mammals and other vertebrate species using whole-genome sequences and existing algorithms. The post holder will use cutting edge computational and laboratory approaches to generate chromosomal assemblies for sequenced genomes, study chromosomal structures and genome differences between bird and other vertebrate species in attempt to identify species- and clade-specific genome signatures.</p>

<p>Applicants must have a Ph.D. and a track record of success, as indicated by first-author publications in international journals. They must possess excellent organisation skills and be capable of individual initiative and of interacting as part of a team. Applicants with extensive practical experience in bioinformatics or computer science, programming, visualization, handling of large data sets, high-performance computing are encouraged to apply. The post will involve collaboration with a wide range of academic partners both within the UK, EU and worldwide. In addition to leading their own project the post holder will have opportunities to contribute to multiple international genome initiatives.</p>

<p>Experience in programming, bioinformatics and comparative genome analysis is essential. Applicants should have a minimum of a degree and preferably a higher degree in a relevant subject.</p>

<p>The Royal Veterinary College has the largest range of veterinary, para-veterinary and animal science undergraduate and postgraduate courses of any veterinary school in the world and is one of the largest veterinary schools in Europe.</p>

<p>Prospective applicants are encouraged to contact Dr. Denis Larkin, Comparative Biomedical Sciences Department on +442071211906 or email: dlarkin@rvc.ac.uk</p>

<p>We offer a generous reward package.</p>

<p>For further information and to apply on-line please visit our website: www.rvc.ac.uk<br />Job reference CBS-0025-14A</p>

<p>Closing date: 4 July 2014<br />Interviews are likely to be held in July 2014</p>

<p>We promote equality of opportunity and diversity within the workplace and welcome applications from all sections of the community.</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/8943/roth-lab</guid>
  <pubDate>Tue, 11 Mar 2014 17:43:45 -0500</pubDate>
  <link></link>
  <title><![CDATA[Roth Lab]]></title>
  <description><![CDATA[
<p>The Roth Lab seeks insight into biological systems through genome- and proteome-scale experimentation and analysis.</p>

<p>Current computational interests:</p>

<p>Systematic analysis of genetic epistasis to identify redundant or compensatory systems and to reveal order of action in genetic pathways.<br />Using knockout, knockdown, or overexpression, or other perturbation experiments in combinations of genes in S. cerevisiae, C. elegans or mouse.<br />Using genome-scale genotyping of natural polymorphisms in S. cerevisiae and human populations.<br />Alternative splicing and its relationship to protein interaction networks.<br />Integrating large-scale studies including phenotype, genetic epistasis, protein-protein and transcription-regulatory interactions and sequence patterns to quantitatively assign function to genes and guide experimentation.</p>

<p>More at http://llama.mshri.on.ca/index.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</guid>
	<pubDate>Fri, 08 Jun 2018 10:47:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</link>
	<title><![CDATA[HALC: High throughput algorithm for long read error correction]]></title>
	<description><![CDATA[HALC, a high throughput algorithm for long read error correction. HALC aligns the long reads to short read contigs from the same species with a relatively low identity requirement so that a long read region can be aligned to at least one contig region, including its true genome region’s repeats in the contigs sufficiently similar to it (similar repeat based alignment approach)

HALC was able to obtain 6.7-41.1% higher throughput than the existing algorithms while maintaining comparable accuracy. The HALC corrected long reads can thus result in 11.4-60.7% longer assembled contigs than the existing algorithms.<p>Address of the bookmark: <a href="https://github.com/lanl001/halc" rel="nofollow">https://github.com/lanl001/halc</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37561/hercules-a-profile-hmm-based-hybrid-error-correction-algorithm-for-long-reads</guid>
	<pubDate>Mon, 20 Aug 2018 14:14:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37561/hercules-a-profile-hmm-based-hybrid-error-correction-algorithm-for-long-reads</link>
	<title><![CDATA[Hercules: a profile HMM-based hybrid error correction algorithm for long reads]]></title>
	<description><![CDATA[<p><span>Choosing whether to use second or third generation sequencing platforms can lead to trade-offs between accuracy and read length. Several studies require long and accurate reads including de novo assembly, fusion and structural variation detection. In such cases researchers often combine both technologies and the more erroneous long reads are corrected using the short reads. Current approaches rely on various graph based alignment techniques and do not take the error profile of the underlying technology into account. Memory- and time- efficient machine learning algorithms that address these shortcomings have the potential to achieve better and more accurate integration of these two technologies. Results: We designed and developed Hercules, the first machine learning-based long read error correction algorithm. The algorithm models every long read as a profile Hidden Markov Model with respect to the underlying platformtextquoterights error profile. The algorithm learns a posterior transition/emission probability distribution for each long read and uses this to correct errors in these reads. Using datasets from two DNA-seq BAC clones (CH17-157L1 and CH17-227A2), and human brain cerebellum polyA RNA-seq, we show that Hercules-corrected reads have the highest mapping rate among all competing algorithms and highest accuracy when most of the basepairs of a long read are covered with short reads. Availability: </span></p>
<p><span>Hercules source code is available at https://github.com/BilkentCompGen/Hercules</span></p><p>Address of the bookmark: <a href="https://github.com/BilkentCompGen/Hercules" rel="nofollow">https://github.com/BilkentCompGen/Hercules</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37776/rhat-a-seed-and-extension-based-noisy-long-read-alignment-tool</guid>
	<pubDate>Sun, 23 Sep 2018 05:12:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37776/rhat-a-seed-and-extension-based-noisy-long-read-alignment-tool</link>
	<title><![CDATA[rHAT: a seed-and-extension-based noisy long read alignment tool]]></title>
	<description><![CDATA[<p><span>rHAT is a seed-and-extension-based noisy long read alignment tool. It is suitable for aligning 3rd generation sequencing reads which are in large read length with relatively high error rate, especially Pacbio's Single Molecule Read-time (SMRT) sequencing reads.</span></p><p>Address of the bookmark: <a href="https://github.com/dfguan/rHAT" rel="nofollow">https://github.com/dfguan/rHAT</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38199/pacasus-correction-of-palindromes-in-long-reads-from-pacbio-and-nanopore</guid>
	<pubDate>Mon, 12 Nov 2018 05:26:48 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38199/pacasus-correction-of-palindromes-in-long-reads-from-pacbio-and-nanopore</link>
	<title><![CDATA[Pacasus: Correction of palindromes in long reads from PacBio and Nanopore]]></title>
	<description><![CDATA[<p><br>Tool for detecting and cleaning PacBio / Nanopore long reads after whole genome amplification. Check the poster from the Revolutionizing Next-Generation Sequencing (2nd edition) conference in the source folder:&nbsp;<a href="https://github.com/swarris/Pacasus/blob/master/vib2017.pdf">https://github.com/swarris/Pacasus/blob/master/vib2017.pdf</a>.</p>
<p>The prepint version is found on&nbsp;<a href="http://www.biorxiv.org/content/early/2017/08/09/173872">http://www.biorxiv.org/content/early/2017/08/09/173872</a></p>
<p>It uses the pyPaSWAS framework for sequence alignment (<a href="https://github.com/swarris/pyPaSWAS">https://github.com/swarris/pyPaSWAS</a>)</p><p>Address of the bookmark: <a href="https://github.com/swarris/Pacasus" rel="nofollow">https://github.com/swarris/Pacasus</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/11181/perl-one-liner-for-bioinformatician</guid>
	<pubDate>Fri, 30 May 2014 05:49:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/11181/perl-one-liner-for-bioinformatician</link>
	<title><![CDATA[Perl one-liner for bioinformatician !!!]]></title>
	<description><![CDATA[<p>With the emergence of NGS technologies, and sequencing data most of the bioinformaticians mung and wrangle around massive amounts of genomics text. There are several "standardized" file formats (FASTQ, SAM, VCF, etc.) and some tools for manipulating them (fastx toolkit, samtools, vcftools, etc.), there are still times where knowing a little bit of Perl onliner is extremely helpful.</p><p>Perl one-liners are small and awesome Perl programs that fit in a single line of code and they do one thing really well. These things include changing line spacing, numbering lines, doing calculations, converting and substituting text, deleting and printing certain lines, parsing logs, editing files in-place, doing statistics, carrying out system administration tasks, updating a bunch of files at once, and many more. Perl one-liners will make you the shell warrior. Anything that took you minutes to solve, will now take you seconds!<br /><br />perl -pe '$\="\n"'&nbsp; &nbsp;<br />#double space a file<br /><br />perl -pe '$_ .= "\n" unless /^$/' <br />#double space a file except blank lines<br /><br />perl -pe '$_.="\n"x7' <br />#7 space in a line.<br /><br />perl -ne 'print unless /^$/' <br />#remove all blank lines<br /><br />perl -lne 'print if length($_) &lt; 20' <br />#print all lines with length less than 20.<br /><br />perl -00 -pe '' <br />#If there are multiple spaces, delete all leaving one(make the file a single spaced file).<br /><br />perl -00 -pe '$_.="\n"x4' <br />#Expand single blank lines into 4 consecutive blank lines<br /><br />perl -pe '$_ = "$. $_"'<br />#Number all lines in a file<br /><br />perl -pe '$_ = ++$a." $_" if /./' <br />#Number only non-empty lines in a file<br /><br />perl -ne 'print ++$a." $_" if /./' <br />#Number and print only non-empty lines in a file<br /><br />perl -pe '$_ = ++$a." $_" if /regex/' <br />#Number only lines that match a pattern<br /><br />perl -ne 'print ++$a." $_" if /regex/' <br />#Number and print only lines that match a pattern<br /><br />perl -ne 'printf "%-5d %s", $., $_ if /regex/' <br />#Left align lines with 5 white spaces if matches a pattern (perl -ne 'printf "%-5d %s", $., $_' : for all the lines)<br /><br />perl -le 'print scalar(grep{/./}&lt;&gt;)' <br />#prints the total number of non-empty lines in a file<br /><br />perl -lne '$a++ if /regex/; END {print $a+0}' <br />#print the total number of lines that matches the pattern<br /><br />perl -alne 'print scalar @F' <br />#print the total number fields(words) in each line.<br /><br />perl -alne '$t += @F; END { print $t}' <br />#Find total number of words in the file<br /><br />perl -alne 'map { /regex/ &amp;&amp; $t++ } @F; END { print $t }' <br />#find total number of fields that match the pattern<br /><br />perl -lne '/regex/ &amp;&amp; $t++; END { print $t }' <br />#Find total number of lines that match a pattern<br /><br />perl -le '$n = 20; $m = 35; ($m,$n) = ($n,$m%$n) while $n; print $m' <br />#will calculate the GCD of two numbers.<br /><br />perl -le '$a = $n = 20; $b = $m = 35; ($m,$n) = ($n,$m%$n) while $n; print $a*$b/$m' <br />#will calculate lcd of 20 and 35.<br /><br />perl -le '$n=10; $min=5; $max=15; $, = " "; print map { int(rand($max-$min))+$min } 1..$n' <br />#Generates 10 random numbers between 5 and 15.<br /><br />perl -le 'print map { ("a".."z",&rdquo;0&rdquo;..&rdquo;9&rdquo;)[rand 36] } 1..8'<br />#Generates a 8 character password from a to z and number 0 &ndash; 9.<br /><br />perl -le 'print map { ("a",&rdquo;t&rdquo;,&rdquo;g&rdquo;,&rdquo;c&rdquo;)[rand 4] } 1..20'<br />#Generates a 20 nucleotide long random residue.<br /><br />perl -le 'print "a"x50'<br />#generate a string of &lsquo;x&rsquo; 50 character long<br /><br />perl -le 'print join ", ", map { ord } split //, "hello world"'<br />#Will print the ascii value of the string hello world.<br /><br />perl -le '@ascii = (99, 111, 100, 105, 110, 103); print pack("C*", @ascii)'<br />#converts ascii values into character strings.<br /><br />perl -le '@odd = grep {$_ % 2 == 1} 1..100; print "@odd"'<br />#Generates an array of odd numbers.<br /><br />perl -le '@even = grep {$_ % 2 == 0} 1..100; print "@even"'<br />#Generate an array of even numbers<br /><br />perl -lpe 'y/A-Za-z/N-ZA-Mn-za-m/' file <br />#Convert the entire file into 13 characters offset(ROT13)<br /><br />perl -nle 'print uc' <br />#Convert all text to uppercase:<br /><br />perl -nle 'print lc' <br />#Convert text to lowercase:<br /><br />perl -nle 'print ucfirst lc' <br />#Convert only first letter of first word to uppercas<br /><br />perl -ple 'y/A-Za-z/a-zA-Z/' <br />#Convert upper case to lower case and vice versa<br /><br />perl -ple 's/(\w+)/\u$1/g' <br />#Camel Casing<br /><br />perl -pe 's|\n|\r\n|' <br />#Convert unix new lines into DOS new lines:<br /><br />perl -pe 's|\r\n|\n|' <br />#Convert DOS newlines into unix new line<br /><br />perl -pe 's|\n|\r|' <br />#Convert unix newlines into MAC newlines:<br /><br />perl -pe '/regexp/ &amp;&amp; s/foo/bar/' <br />#Substitute a foo with a bar in a line with a regexp.</p><p>Reference/Sources:</p><p>http://genomics-array.blogspot.in/2010/11/some-unixperl-oneliners-for.html</p><p><a href="http://genomespot.blogspot.com/2013/08/a-selection-of-useful-bash-one-liners.html">http://genomespot.blogspot.com/2013/08/a-selection-of-useful-bash-one-liners.html</a></p><p><a href="http://biowize.wordpress.com/2012/06/15/command-line-magic-for-your-gene-annotations/">http://biowize.wordpress.com/2012/06/15/command-line-magic-for-your-gene-annotations/</a></p><p><a href="http://genomics-array.blogspot.com/2010/11/some-unixperl-oneliners-for.html">http://genomics-array.blogspot.com/2010/11/some-unixperl-oneliners-for.html</a></p><p><a href="http://bioexpressblog.wordpress.com/2013/04/05/split-multi-fasta-sequence-file/">http://bioexpressblog.wordpress.com/2013/04/05/split-multi-fasta-sequence-file/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35059/lrcstats-long-read-correction-statistics</guid>
	<pubDate>Fri, 05 Jan 2018 04:04:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35059/lrcstats-long-read-correction-statistics</link>
	<title><![CDATA[LRCstats: Long Read Correction Statistics]]></title>
	<description><![CDATA[<p>LRCstats is an open-source pipeline for benchmarking DNA long read correction algorithms for long reads outputted by third generation sequencing technology such as machines produced by Pacific Biosciences. The reads produced by third generation sequencing technology, as the name suggests, are longer in length than reads produced by next generation sequencing technologies, such as those produced by Illumina. However, long reads are plagued by high error rates, which can cause issues in downstream analysis. Long read correction algorithms reduce the error rate of long reads either through self-correcting methods or using accurate, short reads outputted by next generation sequencing technologies to correct long reads.</p>
<p>Of course, some long read correction algorithms are better than others, and developers of long read correction algorithms will wish to compare their algorithm with others currently available. LRCstats benchmarks long read correction algorithms using long reads produced by simulators (such as SimLoRD or PBSim) where the two-way alignments between the uncorrected long reads (uLR) and the corresponding sequences in the reference genome (Ref) are given in some sort of alignment file and then aligning the corrected long reads (cLR) to the Ref-uLR two-way alignments to create three-way alignments using a dynamic programming algorithm. Statistics on these three-way alignments are then collected, such as the overall error rates of the corrected long reads.</p>
<p>https://www.healthcare.uiowa.edu/labs/au/LSC/</p><p>Address of the bookmark: <a href="https://github.com/cchauve/lrcstats" rel="nofollow">https://github.com/cchauve/lrcstats</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/14011/dynamic-chromosome-breakpoints</guid>
	<pubDate>Wed, 13 Aug 2014 18:38:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/14011/dynamic-chromosome-breakpoints</link>
	<title><![CDATA[Dynamic chromosome breakpoints !!!]]></title>
	<description><![CDATA[<p>Cell division involves the distribution of identical genetic material, DNA, to two daughters&rsquo; cells. During this process, duplicated deoxyribonucleic acid (DNA) goes through a condensation and decondensation process. This is followed by nuclear envelope dissolution, mitotic spindle assembly, migration of the sister chromatid pairs to the metaphase plate, division and segregation of identical sets of chromosomes into daughter nuclei and nuclear envelope reformation.</p><p>The vital metaphase stage of cell division, when the sister chromatids migrated to the centre and lined up in a row, and pulled apart using attached microtubules in such a way that half the DNA ends up in each daughter cell. However, before the mitotic spindle‐mediated movement gets start and pulled DNA apart, the chromosomes are free to undergo <strong>recombination </strong>which involves the exchange of genetic material either between multiple chromosomes or between different regions of the same chromosome.</p><p><img src="http://www.sciencelearn.org.nz/var/sciencelearn/storage/images/contexts/uniquely-me/sci-media/images/chromosomes-crossing-over/464438-1-eng-NZ/Chromosomes-crossing-over.jpg" alt="image" width="504" height="342" style="border: 0px; border: 0px;"></p><p>During recombination, the precise breakage of each strand, exchange between the strands, and sealing of the resulting recombined molecules happens. The &ldquo;<strong>chromosomal breakpoints</strong>&rdquo; refers to these places where they break. Mostly, this process occurs with a high degree of accuracy at high frequency in both eukaryotic and prokaryotic cells. But occasionally this &ldquo;break and sealing/ break and reattach&rdquo; process goes wrong and the reattachment happens in the wrong place which usually create disaster (with few exceptions).These chromosome disaster or abnormalities involve the gain, loss or rearrangement of visible amounts of genetic material during cell division. These abnormalities are of two type, the first one is numerical abnormalities &nbsp;where severe disorders are caused by the loss or gain of whole chromosomes, which affect the copy number of hundreds or even thousands of genes. The second are structural abnormalities which can be unbalanced or balanced. The former are similar to numerical abnormalities in that genetic material is either gained or lost. The natural defects in chromosome segregation are linked to cancer and several genetic diseases (http://en.wikipedia.org/wiki/List_of_genetic_disorders). Therefore, the enzymes involved in regulating cell division are still the attractive drug targets for many diseases.</p><p>&nbsp;</p><p>&nbsp;</p><p><img src="http://upload.wikimedia.org/wikipedia/commons/4/4a/Chromosomal_translocations.svg" alt="image" width="424" height="331" style="border: 0px; border: 0px;"></p><p>&nbsp;</p><p>Apart from certain chromosome abnormalities, these &ldquo;crossing over&rdquo; of segments of maternal and paternal chromosomes to form hybrid chromosomes have some evolutionary importance and considered as a driver of genetic variation. Moreover, the chromosome breakage in evolution is considered to be non-random in nature(http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.0020014). In addition the study of breakpoint regions and non-breakpoint (stable) regions of chromosomes indicates both the regions evolved in distinctly different ways ( http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2675965/). These breakage may lead to genetic diseases or participate to chromosomal rearranmgnets and contributed in development of new species.</p><p>I will try to explain the genome hotspots/Evolutionary Breakpoint Regions(EBRs)/fragile regions/weak fragments/&nbsp; in my next blog.</p><p><strong>Software for recombination detection:</strong></p><p><strong>RAT</strong> http://cbr.jic.ac.uk/dicks/software/RAT/</p><p><strong>Breakpointer</strong> https://github.com/ruping/Breakpointer</p><p><strong>DRP</strong> http://web.cbio.uct.ac.za/~darren/rdp.html</p><p><strong>RB-finder</strong> http://www.ncbi.nlm.nih.gov/pubmed/18707535</p><p><strong>LDhat2.0</strong> http://ldhat.sourceforge.net/LDhat2.0/instructions.shtml</p><p><strong>Reference:</strong></p><p>http://www.nature.com/scitable/topicpage/genetic-recombination-514#</p><p>Image: Wikipedia , sciencelearn.org.nz</p><p><strong>Recommended Articles:</strong></p><p>http://www.friendshipcircle.org/blog/2012/05/22/13-chromosomal-disorders-youve-never-heard-of/</p><p>http://web.udl.es/usuaris/e4650869/docencia/segoncicle/genclin98/recursos_classe_%28pdf%29/revisionsPDF/chromosyndromes.pdf</p><p>http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2775595/table/T2/</p><p>http://learn.genetics.utah.edu/content/disorders/chromosomal/</p><p>http://www.ncert.nic.in/html/learning_basket/biology/cc&amp;cd.pdf</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

</channel>
</rss>