<?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/28200?offset=570</link>
	<atom:link href="https://bioinformaticsonline.com/related/28200?offset=570" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/4728/3-days-intensive-course-on-understanding-omics-data-in-basel-switzerland-19-21st-november</guid>
  <pubDate>Mon, 23 Sep 2013 10:46:57 -0500</pubDate>
  <link></link>
  <title><![CDATA[3 days intensive course on Understanding 'omics data in Basel, Switzerland, 19-21st November]]></title>
  <description><![CDATA[
<p>Benefits for the participants</p>

<p>- Plan more efficient experiments<br />- Correctly interpret results<br />- Communicate results in publications more effectively</p>

<p>The course focus is on methodologies, not on particular software tools. After the course participants should be able to apply the methods in their respective environment. However, during the course, hands-on sessions will be performed using the Genedata Expressionist® software, which enables participants to quickly apply the discussed methods and visualize results. No previous knowledge on Expressionist® is required; access to the software is free of charge during the course.</p>

<p>More @ http://www.dixa-fp7.eu/dixa-training/dixa-training-agenda/genedata-academy#!</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/5209/anders-krogh-lab</guid>
  <pubDate>Mon, 30 Sep 2013 19:07:40 -0500</pubDate>
  <link></link>
  <title><![CDATA[Anders Krogh Lab]]></title>
  <description><![CDATA[
<p>In a lot of my work in bioinformatics, I have been using hidden Markov models (HMMs). As a postdoc with David Haussler at UCSC we developed the so-called profile HMMs (refs). Since then I have applied HMMs to membrane proteins (refs) and gene identification (refs) and have worked on methods for such things as discriminative estimation of HMMs (refs) and alternative decoding algorithms etc. (refs).</p>

<p>Now my main interests are in gene regulation, where we work on promoter analysis; non-coding RNA, where miRNAs and structure prediction are the main areas; and protein structure, where the group is working on methods for structure prediction from sequence. To read more about these topics, please see the research pages. </p>

<p>Lab page @ http://wiki.binf.ku.dk/User:Krogh</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/43284/tech-and-bioinformatics-roles-at-basepaws</guid>
  <pubDate>Wed, 18 Aug 2021 23:34:25 -0500</pubDate>
  <link></link>
  <title><![CDATA[Tech and Bioinformatics roles at Basepaws]]></title>
  <description><![CDATA[
<p>Basepaws is an LA-based pet genomics company, quickly growing and focused on feline and canine at-home genetic and biome tests, along with many other projects and products in the works. Thank you for taking a look!</p>

<p>Bioinformatics : https://www.linkedin.com/jobs/view/2681785372/</p>

<p>Engineer: https://www.linkedin.com/jobs/view/2681796993/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/4946/crcri-bioinfomatics-walk-in-on-08102013</guid>
  <pubDate>Fri, 27 Sep 2013 10:59:53 -0500</pubDate>
  <link></link>
  <title><![CDATA[CRCRI Bioinfomatics Walk In on 08.10.2013]]></title>
  <description><![CDATA[
<p>Walk-in-Interview for recruitment of one Project Fellow for a period of 10 months purely on temporary basis is proposed to be held at Central Tuber Crops Research Institute, Sreekariyam, Thiruvananthapuram for a KSCSTE funded project entitled “PARTICIPATORY DEVELOPMENT OF A WEB BASED USER FRIENDLY CASSAVA EXPERT SYSTEM”</p>

<p>Salary: Rs. 10,000/- per month.</p>

<p>Age limit: 35 for men and 40 for women &amp; SC/ST.</p>

<p>Qualification: First class in M. Sc (Agriculture)/MCA/M.Sc (IT)/ M. Sc (Computer Application)/M.Sc (Bioinformatics)/M.Sc (Geoinformatics).</p>

<p>Desirable: Two years experience in web design and web programming.</p>

<p>Date &amp; time of interview: 08.10.2013, 10 am</p>

<p>Interested candidates may appear for an interview at this institute along with their application in plain paper containing the following particulars viz. (1) Name (2) Father/Husband/Guardian’s Name (3) date of birth &amp; age as on 01.10.2013 (4) Permanent address (5) Address for communication (6) Email address and Telephone No. with code (7) Qualification (8) National fellowship like ICAR/CSIR/UGC etc. if any (9) Whether SC/ST/OBC (10) Details of experience (Attested copies of degree certificate, proof of age, mark sheets). Original certificates should be produced for verification.</p>

<p>No TA/DA will be admissible to the candidates attending the test. The selected candidate will have to join immediately.</p>

<p>Advertisement: http://www.ctcri.org/careers/mithra_SRF.doc</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/44352/bioinformatics-tools-for-genome-assembly</guid>
	<pubDate>Mon, 24 Jul 2023 07:04:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44352/bioinformatics-tools-for-genome-assembly</link>
	<title><![CDATA[Bioinformatics tools for genome assembly !]]></title>
	<description><![CDATA[<p>There are numerous genome assembly tools available, each with its strengths and weaknesses. Here is a list of some widely used genome assembly tools as of my last update in September 2021:</p><ol>
<li>
<p><span>SPAdes:</span> An assembler specifically designed for single-cell and multi-cell bacterial genomes, as well as small eukaryotic genomes.</p>
</li>
<li>
<p><span>ABySS:</span> A parallelized assembler for large genomes that uses de Bruijn graphs.</p>
</li>
<li>
<p><span>Velvet:</span> Another de Bruijn graph-based assembler optimized for short-read sequencing data.</p>
</li>
<li>
<p><span>SOAPdenovo:</span> A de Bruijn graph-based assembler designed for short reads, widely used for assembling large and complex genomes.</p>
</li>
<li>
<p><span>MaSuRCA:</span> A hybrid assembler that combines data from multiple sequencing technologies, such as Illumina and PacBio.</p>
</li>
<li>
<p><span>Canu:</span> A long-read assembler optimized for PacBio and Oxford Nanopore sequencing data.</p>
</li>
<li>
<p><span>Flye:</span> A long-read assembler suitable for bacterial and small eukaryotic genomes.</p>
</li>
<li>
<p><span>SMARTdenovo:</span> An assembler designed for long reads, particularly suited for PacBio data.</p>
</li>
<li>
<p><span>SPAdes Long Read (SPAdesLR):</span> An extension of SPAdes for long-read data, such as those from PacBio or Nanopore.</p>
</li>
<li>
<p><span>Minia:</span> An assembler optimized for low memory consumption, suitable for small and medium-sized genomes.</p>
</li>
<li>
<p><span>Unicycler:</span> A hybrid assembler that combines short and long reads for circular bacterial genome assembly.</p>
</li>
<li>
<p><span>wtdbg2:</span> A de Bruijn graph assembler for long reads, efficient for very large genomes.</p>
</li>
<li>
<p><span>Shasta:</span> A long-read assembler that uses the Overlap-Layout-Consensus approach, suitable for PacBio and Nanopore data.</p>
</li>
<li>
<p><span>Sparc:</span> An assembler designed to handle noisy long reads from Nanopore sequencing.</p>
</li>
<li>
<p><span>CANA:</span> An assembler for metagenomic data, particularly for complex and diverse microbial communities.</p>
</li>
<li>
<p><span>Ra</span> Assembler: A metagenome assembler for long reads, designed for highly complex metagenomic samples.</p>
</li>
</ol><p>Please note that the field of bioinformatics is constantly evolving, and new assembly tools may have emerged since my last update. Additionally, the performance of these tools can vary depending on the characteristics of the sequencing data and the genome being assembled. When selecting an assembly tool, consider the specific requirements of your project, the available data types, and the computational resources at your disposal. Always refer to the respective tool's documentation and publications for the most up-to-date information and recommendations.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/5187/bioinformatics-algorithms-part-1-with-pavel-pevzner-phillip-e-c-compeau</guid>
	<pubDate>Mon, 30 Sep 2013 11:34:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/5187/bioinformatics-algorithms-part-1-with-pavel-pevzner-phillip-e-c-compeau</link>
	<title><![CDATA[Bioinformatics Algorithms (Part 1)  with Pavel  Pevzner, Phillip E. C. Compeau,]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/t5t_nfzdzEg" frameborder="0" allowfullscreen></iframe><p>The course Bioinformatics Algorithms (Part 1) by Pavel Pevzner, Phillip E. C. Compeau, and Nikolay Vyahhi from University of California, San Diego will be offered free of charge to everyone on the Coursera platform. Sign up at http://www.coursera.org/course/bioinformatics.</p>]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44930/bioinformatics-the-bridge-between-curiosity-and-discovery</guid>
	<pubDate>Mon, 24 Nov 2025 05:16:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44930/bioinformatics-the-bridge-between-curiosity-and-discovery</link>
	<title><![CDATA[Bioinformatics: The Bridge Between Curiosity and Discovery]]></title>
	<description><![CDATA[<p>In the sprawling universe of modern science, bioinformatics stands as one of the most transformative and empowering fields of our time. It is where biology meets computation, where data becomes meaning, and where curiosity becomes discovery. If you&rsquo;ve stepped into this world&mdash;or are considering it&mdash;here&rsquo;s your reminder: you&rsquo;re part of a revolution.</p><p><strong>Why Bioinformatics Matters More Than Ever</strong></p><p>Every day, our world generates massive amounts of biological data&mdash;from genome sequences to microbiome profiles to real-time pathogen surveillance. Hidden within these datasets are the answers to some of the greatest challenges humanity faces: emerging diseases, antimicrobial resistance, environmental stress, genetic disorders, sustainable agriculture, and more.</p><p>Bioinformatics isn&rsquo;t just a skill.<br />It&rsquo;s the language of the future of biology.</p><p>By mastering it, you give yourself the power to:</p><p>Decode genomes and understand life at its most fundamental level</p><p>Identify patterns no microscope could ever reveal</p><p>Predict disease outbreaks before they occur</p><p>Accelerate drug discovery with computational precision</p><p>Contribute to open-source tools that empower scientists worldwide</p><p>You don&rsquo;t just follow science&mdash;you drive it.</p><p><strong>Every Expert Was Once a Beginner</strong></p><p>Many newcomers feel intimidated. Command-line interfaces. R scripts. Python packages. Next-generation sequencing data. Complex machine learning models.</p><p>But here&rsquo;s the truth: every bioinformatician started exactly where you are now&mdash;curious, unsure, but excited.</p><p>No one writes perfect code on day one.</p><p>No one understands genomics pipelines immediately.</p><p>What makes you a bioinformatician is not perfection, but perseverance.</p><p>When your script throws a cryptic error&hellip;<br />When your data refuses to format&hellip;<br />When your pipeline runs for 6 hours only to crash&hellip;</p><p>Remember: this is part of the journey.<br />Every error teaches you. Every retry strengthens you. Every breakthrough energizes you.</p><p>Bioinformatics Is Not Just a Career&mdash;It&rsquo;s a Mindset</p><p>It&rsquo;s the mindset of:</p><p>Problem-solving.</p><p>Continuous learning.</p><p>Turning chaos into clarity.</p><p>Seeing what others can&rsquo;t.</p><p>Bioinformaticians are detectives of biological complexity. You sit at the intersection of innovation, using tools that can shape public health, medicine, agriculture, and ecology. Few fields give you such direct impact on the world.</p><p><strong>Your Contribution Matters</strong></p><p>As you work on your script, pipeline, genome, or model, remember:</p><p>Somewhere, your analysis might contribute to:</p><p>A new therapy</p><p>A faster diagnostic test</p><p>A better understanding of a pathogen</p><p>A more resilient crop</p><p>An open-source dataset that helps thousands</p><p>A discovery that rewrites textbooks</p><p>Your code may be small, but its ripple effect is powerful.</p><p>The Future Is Bioinformatics&mdash;And You Are Part of It</p><p>The world is shifting. Wet labs are integrating AI. Hospitals rely on genomic insights. Farmers use gene-level predictions. Governments monitor disease in real time. Students launch pipelines that become global tools.</p><p>This is a golden era&mdash;and you are not late.<br />You are exactly where you need to be.</p><p>Keep Pushing. Keep Learning. Keep Discovering.</p><p>Bioinformatics is a journey filled with challenges, but also with unmatched rewards.</p><p>So the next time you feel stuck, frustrated, or overwhelmed, remember:<br />You&rsquo;re building the science of tomorrow.</p><p>Be proud. Stay curious. Keep going.<br />Your work matters more than you think.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/5255/walk-in-interview-indian-agricultural-statistics-research-institute</guid>
  <pubDate>Wed, 02 Oct 2013 15:40:17 -0500</pubDate>
  <link></link>
  <title><![CDATA[Walk-in-Interview @ Indian Agricultural Statistics Research Institute]]></title>
  <description><![CDATA[
<p>Indian Agricultural Statistics Research Institute<br />Library Avenue, Pusa, New Delhi – 110012</p>

<p>Walk-in-Interview</p>

<p>Walk-in-interview will be held on October 5, 2013 at 10:00 A.M. at IASRI, New Delhi for a project “A New Distributed Computing Framework for Data Mining” funded by Department of Electronics and Information Technology, Government of India for the following posts. The appointment will be on contractual basis upto 14th October, 2015 or till the termination of the project whichever is earlier and the incumbent shall not have any claim for regular appointment under ICAR.</p>

<p>Research Associate</p>

<p>    Ph.D. in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent or</p>

<p>    Post-Graduation in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent with 1st Division and at least two years of research experience</p>

<p>     Knowledge of Statistical Analysis /Bioinformatics tools for computational genomics.</p>

<p>     Knowledge of R/Perl programming language</p>

<p>Research Associate</p>

<p>    Ph.D. in Computer Science/ Computer Application / Bioinformatics/ Agricultural<br />    Statistics/ Statistics or equivalent or</p>

<p>    Post-Graduation in Computer Science/ Computer Application /Bioinformatics/ Agricultural Statistics/ Statistics or equivalent with 1st Division and at least two years of research experience</p>

<p>     Expertise in Java programming.<br />     Knowledge of system administration and networking under Linux environment.<br />     Knowledge of parallel programming and cluster computing.</p>

<p>Emoluments for Research Associate: Consolidated Rs:24000/- per month + HRA (for Ph.D. Degree holders) and Rs:23000/- per month + HRA (for Master’s Degree holders)</p>

<p>Age Limit: Age should be not more than 40 years (5 years relaxation for  SC/ST/women candidates and 3 years for OBC candidates as on date of interview).</p>

<p>Interested candidates are requested to appear for Walk-in-Interview on the date and time as specified above in Room No. 106, Training Cum Administrative Block of the Institute along with their application giving bio-data with attested copies of certificates, degrees, testimonials, etc. and one passport size photograph.</p>

<p>Original certificates/ Degrees are needed to be produced at the time of interview.</p>

<p>No T.A. /D.A. will be paid for appearing in the interview.</p>

<p>Advertisement: http://www.iasri.res.in/employment/employment.htm</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/39307/awk-for-beginners</guid>
	<pubDate>Fri, 26 Apr 2019 16:19:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/39307/awk-for-beginners</link>
	<title><![CDATA[AWK for beginners !]]></title>
	<description><![CDATA[<p>AWK is a standard tool on every POSIX-compliant UNIX system. It&rsquo;s like flex/lex, from the command-line, perfect for text-processing tasks and other scripting needs. It has a C-like syntax, but without mandatory semicolons (although, you should use them anyway, because they are required when you&rsquo;re writing one-liners, something AWK excels at), manual memory management, or static typing. It excels at text processing. You can call to it from a shell script, or you can use it as a stand-alone scripting language.</p><p>Why use AWK instead of Perl? Readability. AWK is easier to read than Perl. For simple text-processing scripts, particularly ones that read files line by line and split on delimiters, AWK is probably the right tool for the job.</p><div><pre><span>#!/usr/bin/awk -f</span>

<span># Comments are like this</span>


<span># AWK programs consist of a collection of patterns and actions.</span>
<span>pattern1</span> <span>{</span> <span>action</span><span>;</span> <span>}</span> <span># just like lex</span>
<span>pattern2</span> <span>{</span> <span>action</span><span>;</span> <span>}</span>

<span># There is an implied loop and AWK automatically reads and parses each</span>
<span># record of each file supplied. Each record is split by the FS delimiter,</span>
<span># which defaults to white-space (multiple spaces,tabs count as one)</span>
<span># You can assign FS either on the command line (-F C) or in your BEGIN</span>
<span># pattern</span>

<span># One of the special patterns is BEGIN. The BEGIN pattern is true</span>
<span># BEFORE any of the files are read. The END pattern is true after</span>
<span># an End-of-file from the last file (or standard-in if no files specified)</span>
<span># There is also an output field separator (OFS) that you can assign, which</span>
<span># defaults to a single space</span>

<span>BEGIN</span> <span>{</span>

    <span># BEGIN will run at the beginning of the program. It's where you put all</span>
    <span># the preliminary set-up code, before you process any text files. If you</span>
    <span># have no text files, then think of BEGIN as the main entry point.</span>

    <span># Variables are global. Just set them or use them, no need to declare..</span>
    <span>count</span> <span>=</span> <span>0</span><span>;</span>

    <span># Operators just like in C and friends</span>
    <span>a</span> <span>=</span> <span>count</span> <span>+</span> <span>1</span><span>;</span>
    <span>b</span> <span>=</span> <span>count</span> <span>-</span> <span>1</span><span>;</span>
    <span>c</span> <span>=</span> <span>count</span> <span>*</span> <span>1</span><span>;</span>
    <span>d</span> <span>=</span> <span>count</span> <span>/</span> <span>1</span><span>;</span> <span># integer division</span>
    <span>e</span> <span>=</span> <span>count</span> <span>%</span> <span>1</span><span>;</span> <span># modulus</span>
    <span>f</span> <span>=</span> <span>count</span> <span>^</span> <span>1</span><span>;</span> <span># exponentiation</span>

    <span>a</span> <span>+=</span> <span>1</span><span>;</span>
    <span>b</span> <span>-=</span> <span>1</span><span>;</span>
    <span>c</span> <span>*=</span> <span>1</span><span>;</span>
    <span>d</span> <span>/=</span> <span>1</span><span>;</span>
    <span>e</span> <span>%=</span> <span>1</span><span>;</span>
    <span>f</span> <span>^=</span> <span>1</span><span>;</span>

    <span># Incrementing and decrementing by one</span>
    <span>a</span><span>++</span><span>;</span>
    <span>b</span><span>--</span><span>;</span>

    <span># As a prefix operator, it returns the incremented value</span>
    <span>++</span><span>a</span><span>;</span>
    <span>--</span><span>b</span><span>;</span>

    <span># Notice, also, no punctuation such as semicolons to terminate statements</span>

    <span># Control statements</span>
    <span>if</span> <span>(</span><span>count</span> <span>==</span> <span>0</span><span>)</span>
        <span>print</span> <span>"Starting with count of 0"</span><span>;</span>
    <span>else</span>
        <span>print</span> <span>"Huh?"</span><span>;</span>

    <span># Or you could use the ternary operator</span>
    <span>print</span> <span>(</span><span>count</span> <span>==</span> <span>0</span><span>)</span> <span>?</span> <span>"Starting with count of 0"</span> <span>:</span> <span>"Huh?"</span><span>;</span>

    <span># Blocks consisting of multiple lines use braces</span>
    <span>while</span> <span>(</span><span>a</span> <span>&lt;</span> <span>10</span><span>)</span> <span>{</span>
        <span>print</span> <span>"String concatenation is done"</span> <span>" with a series"</span> <span>" of"</span>
            <span>" space-separated strings"</span><span>;</span>
        <span>print</span> <span>a</span><span>;</span>

        <span>a</span><span>++</span><span>;</span>
    <span>}</span>

    <span>for</span> <span>(</span><span>i</span> <span>=</span> <span>0</span><span>;</span> <span>i</span> <span>&lt;</span> <span>10</span><span>;</span> <span>i</span><span>++</span><span>)</span>
        <span>print</span> <span>"Good ol' for loop"</span><span>;</span>

    <span># As for comparisons, they're the standards:</span>
    <span># a &lt; b   # Less than</span>
    <span># a &lt;= b  # Less than or equal</span>
    <span># a != b  # Not equal</span>
    <span># a == b  # Equal</span>
    <span># a &gt; b   # Greater than</span>
    <span># a &gt;= b  # Greater than or equal</span>

    <span># Logical operators as well</span>
    <span># a &amp;&amp; b  # AND</span>
    <span># a || b  # OR</span>

    <span># In addition, there's the super useful regular expression match</span>
    <span>if</span> <span>(</span><span>"foo"</span> <span>~</span> <span>"^fo+$"</span><span>)</span>
        <span>print</span> <span>"Fooey!"</span><span>;</span>
    <span>if</span> <span>(</span><span>"boo"</span> <span>!~</span> <span>"^fo+$"</span><span>)</span>
        <span>print</span> <span>"Boo!"</span><span>;</span>

    <span># Arrays</span>
    <span>arr</span><span>[</span><span>0</span><span>]</span> <span>=</span> <span>"foo"</span><span>;</span>
    <span>arr</span><span>[</span><span>1</span><span>]</span> <span>=</span> <span>"bar"</span><span>;</span>

    <span># You can also initialize an array with the built-in function split()</span>

    <span>n</span> <span>=</span> <span>split</span><span>(</span><span>"foo:bar:baz"</span><span>,</span> <span>arr</span><span>,</span> <span>":"</span><span>);</span>

    <span># You also have associative arrays (actually, they're all associative arrays)</span>
    <span>assoc</span><span>[</span><span>"foo"</span><span>]</span> <span>=</span> <span>"bar"</span><span>;</span>
    <span>assoc</span><span>[</span><span>"bar"</span><span>]</span> <span>=</span> <span>"baz"</span><span>;</span>

    <span># And multi-dimensional arrays, with some limitations I won't mention here</span>
    <span>multidim</span><span>[</span><span>0</span><span>,</span><span>0</span><span>]</span> <span>=</span> <span>"foo"</span><span>;</span>
    <span>multidim</span><span>[</span><span>0</span><span>,</span><span>1</span><span>]</span> <span>=</span> <span>"bar"</span><span>;</span>
    <span>multidim</span><span>[</span><span>1</span><span>,</span><span>0</span><span>]</span> <span>=</span> <span>"baz"</span><span>;</span>
    <span>multidim</span><span>[</span><span>1</span><span>,</span><span>1</span><span>]</span> <span>=</span> <span>"boo"</span><span>;</span>

    <span># You can test for array membership</span>
    <span>if</span> <span>(</span><span>"foo"</span> <span>in</span> <span>assoc</span><span>)</span>
        <span>print</span> <span>"Fooey!"</span><span>;</span>

    <span># You can also use the 'in' operator to traverse the keys of an array</span>
    <span>for</span> <span>(</span><span>key</span> <span>in</span> <span>assoc</span><span>)</span>
        <span>print</span> <span>assoc</span><span>[</span><span>key</span><span>];</span>

    <span># The command line is in a special array called ARGV</span>
    <span>for</span> <span>(</span><span>argnum</span> <span>in</span> <span>ARGV</span><span>)</span>
        <span>print</span> <span>ARGV</span><span>[</span><span>argnum</span><span>];</span>

    <span># You can remove elements of an array</span>
    <span># This is particularly useful to prevent AWK from assuming the arguments</span>
    <span># are files for it to process</span>
    <span>delete</span> <span>ARGV</span><span>[</span><span>1</span><span>];</span>

    <span># The number of command line arguments is in a variable called ARGC</span>
    <span>print</span> <span>ARGC</span><span>;</span>

    <span># AWK has several built-in functions. They fall into three categories. I'll</span>
    <span># demonstrate each of them in their own functions, defined later.</span>

    <span>return_value</span> <span>=</span> <span>arithmetic_functions</span><span>(</span><span>a</span><span>,</span> <span>b</span><span>,</span> <span>c</span><span>);</span>
    <span>string_functions</span><span>();</span>
    <span>io_functions</span><span>();</span>
<span>}</span>

<span># Here's how you define a function</span>
<span>function</span> <span>arithmetic_functions</span><span>(</span><span>a</span><span>,</span> <span>b</span><span>,</span> <span>c</span><span>,</span>     <span>d</span><span>)</span> <span>{</span>

    <span># Probably the most annoying part of AWK is that there are no local</span>
    <span># variables. Everything is global. For short scripts, this is fine, even</span>
    <span># useful, but for longer scripts, this can be a problem.</span>

    <span># There is a work-around (ahem, hack). Function arguments are local to the</span>
    <span># function, and AWK allows you to define more function arguments than it</span>
    <span># needs. So just stick local variable in the function declaration, like I</span>
    <span># did above. As a convention, stick in some extra whitespace to distinguish</span>
    <span># between actual function parameters and local variables. In this example,</span>
    <span># a, b, and c are actual parameters, while d is merely a local variable.</span>

    <span># Now, to demonstrate the arithmetic functions</span>

    <span># Most AWK implementations have some standard trig functions</span>
    <span>localvar</span> <span>=</span> <span>sin</span><span>(</span><span>a</span><span>);</span>
    <span>localvar</span> <span>=</span> <span>cos</span><span>(</span><span>a</span><span>);</span>
    <span>localvar</span> <span>=</span> <span>atan2</span><span>(</span><span>b</span><span>,</span> <span>a</span><span>);</span> <span># arc tangent of b / a</span>

    <span># And logarithmic stuff</span>
    <span>localvar</span> <span>=</span> <span>exp</span><span>(</span><span>a</span><span>);</span>
    <span>localvar</span> <span>=</span> <span>log</span><span>(</span><span>a</span><span>);</span>

    <span># Square root</span>
    <span>localvar</span> <span>=</span> <span>sqrt</span><span>(</span><span>a</span><span>);</span>

    <span># Truncate floating point to integer</span>
    <span>localvar</span> <span>=</span> <span>int</span><span>(</span><span>5.34</span><span>);</span> <span># localvar =&gt; 5</span>

    <span># Random numbers</span>
    <span>srand</span><span>();</span> <span># Supply a seed as an argument. By default, it uses the time of day</span>
    <span>localvar</span> <span>=</span> <span>rand</span><span>();</span> <span># Random number between 0 and 1.</span>

    <span># Here's how to return a value</span>
    <span>return</span> <span>localvar</span><span>;</span>
<span>}</span>

<span>function</span> <span>string_functions</span><span>(</span>    <span>localvar</span><span>,</span> <span>arr</span><span>)</span> <span>{</span>

    <span># AWK, being a string-processing language, has several string-related</span>
    <span># functions, many of which rely heavily on regular expressions.</span>

    <span># Search and replace, first instance (sub) or all instances (gsub)</span>
    <span># Both return number of matches replaced</span>
    <span>localvar</span> <span>=</span> <span>"fooooobar"</span><span>;</span>
    <span>sub</span><span>(</span><span>"fo+"</span><span>,</span> <span>"Meet me at the "</span><span>,</span> <span>localvar</span><span>);</span> <span># localvar =&gt; "Meet me at the bar"</span>
    <span>gsub</span><span>(</span><span>"e+"</span><span>,</span> <span>"."</span><span>,</span> <span>localvar</span><span>);</span> <span># localvar =&gt; "m..t m. at th. bar"</span>

    <span># Search for a string that matches a regular expression</span>
    <span># index() does the same thing, but doesn't allow a regular expression</span>
    <span>match</span><span>(</span><span>localvar</span><span>,</span> <span>"t"</span><span>);</span> <span># =&gt; 4, since the 't' is the fourth character</span>

    <span># Split on a delimiter</span>
    <span>n</span> <span>=</span> <span>split</span><span>(</span><span>"foo-bar-baz"</span><span>,</span> <span>arr</span><span>,</span> <span>"-"</span><span>);</span> <span># a[1] = "foo"; a[2] = "bar"; a[3] = "baz"; n = 3</span>

    <span># Other useful stuff</span>
    <span>sprintf</span><span>(</span><span>"%s %d %d %d"</span><span>,</span> <span>"Testing"</span><span>,</span> <span>1</span><span>,</span> <span>2</span><span>,</span> <span>3</span><span>);</span> <span># =&gt; "Testing 1 2 3"</span>
    <span>substr</span><span>(</span><span>"foobar"</span><span>,</span> <span>2</span><span>,</span> <span>3</span><span>);</span> <span># =&gt; "oob"</span>
    <span>substr</span><span>(</span><span>"foobar"</span><span>,</span> <span>4</span><span>);</span> <span># =&gt; "bar"</span>
    <span>length</span><span>(</span><span>"foo"</span><span>);</span> <span># =&gt; 3</span>
    <span>tolower</span><span>(</span><span>"FOO"</span><span>);</span> <span># =&gt; "foo"</span>
    <span>toupper</span><span>(</span><span>"foo"</span><span>);</span> <span># =&gt; "FOO"</span>
<span>}</span>

<span>function</span> <span>io_functions</span><span>(</span>    <span>localvar</span><span>)</span> <span>{</span>

    <span># You've already seen print</span>
    <span>print</span> <span>"Hello world"</span><span>;</span>

    <span># There's also printf</span>
    <span>printf</span><span>(</span><span>"%s %d %d %d\n"</span><span>,</span> <span>"Testing"</span><span>,</span> <span>1</span><span>,</span> <span>2</span><span>,</span> <span>3</span><span>);</span>

    <span># AWK doesn't have file handles, per se. It will automatically open a file</span>
    <span># handle for you when you use something that needs one. The string you used</span>
    <span># for this can be treated as a file handle, for purposes of I/O. This makes</span>
    <span># it feel sort of like shell scripting, but to get the same output, the string</span>
    <span># must match exactly, so use a variable:</span>

    <span>outfile</span> <span>=</span> <span>"/tmp/foobar.txt"</span><span>;</span>

    <span>print</span> <span>"foobar"</span> <span>&gt;</span> <span>outfile</span><span>;</span>

    <span># Now the string outfile is a file handle. You can close it:</span>
    <span>close</span><span>(</span><span>outfile</span><span>);</span>

    <span># Here's how you run something in the shell</span>
    <span>system</span><span>(</span><span>"echo foobar"</span><span>);</span> <span># =&gt; prints foobar</span>

    <span># Reads a line from standard input and stores in localvar</span>
    <span>getline</span> <span>localvar</span><span>;</span>

    <span># Reads a line from a pipe (again, use a string so you close it properly)</span>
    <span>cmd</span> <span>=</span> <span>"echo foobar"</span><span>;</span>
    <span>cmd</span> <span>|</span> <span>getline</span> <span>localvar</span><span>;</span> <span># localvar =&gt; "foobar"</span>
    <span>close</span><span>(</span><span>cmd</span><span>);</span>

    <span># Reads a line from a file and stores in localvar</span>
    <span>infile</span> <span>=</span> <span>"/tmp/foobar.txt"</span><span>;</span>
    <span>getline</span> <span>localvar</span> <span>&lt;</span> <span>infile</span><span>;</span> 
    <span>close</span><span>(</span><span>infile</span><span>);</span>
<span>}</span>

<span># As I said at the beginning, AWK programs consist of a collection of patterns</span>
<span># and actions. You've already seen the BEGIN pattern. Other</span>
<span># patterns are used only if you're processing lines from files or standard</span>
<span># input.</span>
<span>#</span>
<span># When you pass arguments to AWK, they are treated as file names to process.</span>
<span># It will process them all, in order. Think of it like an implicit for loop,</span>
<span># iterating over the lines in these files. these patterns and actions are like</span>
<span># switch statements inside the loop. </span>

<span>/^fo+bar$/</span> <span>{</span>

    <span># This action will execute for every line that matches the regular</span>
    <span># expression, /^fo+bar$/, and will be skipped for any line that fails to</span>
    <span># match it. Let's just print the line:</span>

    <span>print</span><span>;</span>

    <span># Whoa, no argument! That's because print has a default argument: $0.</span>
    <span># $0 is the name of the current line being processed. It is created</span>
    <span># automatically for you.</span>

    <span># You can probably guess there are other $ variables. Every line is</span>
    <span># implicitly split before every action is called, much like the shell</span>
    <span># does. And, like the shell, each field can be access with a dollar sign</span>

    <span># This will print the second and fourth fields in the line</span>
    <span>print</span> <span>$</span><span>2</span><span>,</span> <span>$</span><span>4</span><span>;</span>

    <span># AWK automatically defines many other variables to help you inspect and</span>
    <span># process each line. The most important one is NF</span>

    <span># Prints the number of fields on this line</span>
    <span>print</span> <span>NF</span><span>;</span>

    <span># Print the last field on this line</span>
    <span>print</span> <span>$</span><span>NF</span><span>;</span>
<span>}</span>

<span># Every pattern is actually a true/false test. The regular expression in the</span>
<span># last pattern is also a true/false test, but part of it was hidden. If you</span>
<span># don't give it a string to test, it will assume $0, the line that it's</span>
<span># currently processing. Thus, the complete version of it is this:</span>

<span>$</span><span>0</span> <span>~</span> <span>/^fo+bar$/</span> <span>{</span>
    <span>print</span> <span>"Equivalent to the last pattern"</span><span>;</span>
<span>}</span>

<span>a</span> <span>&gt;</span> <span>0</span> <span>{</span>
    <span># This will execute once for each line, as long as a is positive</span>
<span>}</span>

<span># You get the idea. Processing text files, reading in a line at a time, and</span>
<span># doing something with it, particularly splitting on a delimiter, is so common</span>
<span># in UNIX that AWK is a scripting language that does all of it for you, without</span>
<span># you needing to ask. All you have to do is write the patterns and actions</span>
<span># based on what you expect of the input, and what you want to do with it.</span>

<span># Here's a quick example of a simple script, the sort of thing AWK is perfect</span>
<span># for. It will read a name from standard input and then will print the average</span>
<span># age of everyone with that first name. Let's say you supply as an argument the</span>
<span># name of a this data file:</span>
<span>#</span>
<span># Bob Jones 32</span>
<span># Jane Doe 22</span>
<span># Steve Stevens 83</span>
<span># Bob Smith 29</span>
<span># Bob Barker 72</span>
<span>#</span>
<span># Here's the script:</span>

<span>BEGIN</span> <span>{</span>

    <span># First, ask the user for the name</span>
    <span>print</span> <span>"What name would you like the average age for?"</span><span>;</span>

    <span># Get a line from standard input, not from files on the command line</span>
    <span>getline</span> <span>name</span> <span>&lt;</span> <span>"/dev/stdin"</span><span>;</span>
<span>}</span>

<span># Now, match every line whose first field is the given name</span>
<span>$</span><span>1</span> <span>==</span> <span>name</span> <span>{</span>

    <span># Inside here, we have access to a number of useful variables, already</span>
    <span># pre-loaded for us:</span>
    <span># $0 is the entire line</span>
    <span># $3 is the third field, the age, which is what we're interested in here</span>
    <span># NF is the number of fields, which should be 3</span>
    <span># NR is the number of records (lines) seen so far</span>
    <span># FILENAME is the name of the file being processed</span>
    <span># FS is the field separator being used, which is " " here</span>
    <span># ...etc. There are plenty more, documented in the man page.</span>

    <span># Keep track of a running total and how many lines matched</span>
    <span>sum</span> <span>+=</span> <span>$</span><span>3</span><span>;</span>
    <span>nlines</span><span>++</span><span>;</span>
<span>}</span>

<span># Another special pattern is called END. It will run after processing all the</span>
<span># text files. Unlike BEGIN, it will only run if you've given it input to</span>
<span># process. It will run after all the files have been read and processed</span>
<span># according to the rules and actions you've provided. The purpose of it is</span>
<span># usually to output some kind of final report, or do something with the</span>
<span># aggregate of the data you've accumulated over the course of the script.</span>

<span>END</span> <span>{</span>
    <span>if</span> <span>(</span><span>nlines</span><span>)</span>
        <span>print</span> <span>"The average age for "</span> <span>name</span> <span>" is "</span> <span>sum</span> <span>/</span> <span>nlines</span><span>;</span>
<span>}</span>
</pre><p><span>&nbsp;</span></p></div>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/5422/shendure-lab</guid>
  <pubDate>Wed, 09 Oct 2013 14:21:58 -0500</pubDate>
  <link></link>
  <title><![CDATA[Shendure Lab]]></title>
  <description><![CDATA[
<p>The Shendure Lab is part of the Department of Genome Sciences at the University of Washington (Seattle, WA). The mission of the lab is to develop and apply new technologies in genomics and molecular biology. Most projects in the lab exploit new DNA sequencing technologies (Shendure et al., Nature Reviews Genetics 2004; Shendure &amp; Ji, Nature Biotechnology 2008; Shendure &amp; Lieberman Aiden, Nature Biotechnology 2012), and generally fall into one of six areas: 1) next-generation human genetics; 2) genome contiguity &amp; completeness; 3) massively parallel functional analysis; 4) molecular tagging; 5) synthetic biology; 6) translational genomics. Our interests in each of these areas are outlined briefly below, and a full list of publications is available via PubMed. http://www.ncbi.nlm.nih.gov/pubmed?cmd=search&amp;term=shendure<br />More http://krishna.gs.washington.edu/research.html</p>

<p>Lab page @ http://krishna.gs.washington.edu/index.html</p>
]]></description>
</item>

</channel>
</rss>