<?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/42811?offset=70</link>
	<atom:link href="https://bioinformaticsonline.com/related/42811?offset=70" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/2335/embo-practical-course-bioinformatics-large-scale-data-at-shenzhen-china</guid>
  <pubDate>Wed, 14 Aug 2013 09:50:56 -0500</pubDate>
  <link></link>
  <title><![CDATA[EMBO Practical Course, Bioinformatics, large-scale data, at Shenzhen, China]]></title>
  <description><![CDATA[
<p>This international advanced course will provide training on bioinformatics and statistics methods for genomic research. It will give insight into how biological knowledge can be generated from high-throughput sequencing (DNA-Seq, RNA-seq, ChIP-seq) experiments and will illustrate how to analyze such data. The course covers both the underlying statistical and algorithmic concepts, and the practice of how to automate and code such analyses using the scripting language R.</p>

<p>17 Nov 2013 -22 Nov 2013</p>

<p>More at http://events.embo.org/13-large-scale-data/</p>

<p>Online Registration: https://www.conference-service.com/pc13-47/welcome.cgi</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/24074/bioinformatics-training-fellowship</guid>
  <pubDate>Fri, 28 Aug 2015 16:02:25 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Training Fellowship !!]]></title>
  <description><![CDATA[
<p>Applications are invited from suitable candidates for six months ‘Training Fellowship’ in Bioinformatics under the BTISNET program of DBT in the Distributed Information Sub center (DISC) facility at NIPGR, New Delhi, under the supervision of Dr. Gitanjali Yadav, Scientist, NIPGR.</p>

<p>Project Title 	No. of post(s) 	Designation 	Stipend in  	Tenure 	Start 	End<br />Establishment of Distributed Information Sub-Centre (DISC) 	02 	Trainee Fellow / Student Fellow 	5,000/- p.m 	Six months 	01/01/2016 	30/06/2016</p>

<p>Essential Qualification: </p>

<p>Traineeship: Candidate having B.Tech or Master Degree or equivalent in Bioinformatics/ Biotechnology with strong interest in Computational Biology and First class/ division throughout academic career may apply. </p>

<p>Studentship: Students currently pursuing the final year of B.Tech or Masters Degree or equivalent in Bioinformatics/ Biotechnology, requiring a thesis as a necessary pre-requisite for completion of respective degree and First class/ division throughout academic career may apply.</p>

<p>Desirable Qualification: Proficiency in Coding Algorithms and Bioinformatics Applications, evidenced by short trainings or computing courses.</p>

<p>The positions are purely temporary and co-terminus with the tenure of the training period as mentioned above. NIPGR reserves the right to select the candidate against the above fellowship depending upon the qualification and experience of the candidate. Reservations shall be as per Govt. of India norms. The applicants will have no claim implicit or explicit for consideration against any regular position of DISC/NIPGR.</p>

<p>Eligible candidates may apply online application form available</p>

<p>at http://www.nipgr.res.in/discform.html within 15 days from the date of</p>

<p>advertisement.Applications received through any other mode will be disqualified outright. </p>

<p>More at http://www.nipgr.res.in/discform.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44204/bioinformatics-training-collections</guid>
	<pubDate>Sun, 05 Mar 2023 23:01:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44204/bioinformatics-training-collections</link>
	<title><![CDATA[Bioinformatics Training Collections !]]></title>
	<description><![CDATA[<p>Useful list of bioinformatics training collections @&nbsp;https://github.com/sib-swiss/training-collection</p><p>Address of the bookmark: <a href="https://github.com/sib-swiss/training-collection" rel="nofollow">https://github.com/sib-swiss/training-collection</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26539/scikit-learn</guid>
	<pubDate>Mon, 29 Feb 2016 17:39:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26539/scikit-learn</link>
	<title><![CDATA[scikit-learn]]></title>
	<description><![CDATA[<p>Machine Learning in Python</p>
<p>Simple and efficient tools for data mining and data analysis<br> Accessible to everybody, and reusable in various contexts<br> Built on NumPy, SciPy, and matplotlib<br> Open source, commercially usable - BSD license</p>
<p>More at&nbsp;http://scikit-learn.org/stable/index.html</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://scikit-learn.org/stable/auto_examples/index.html" rel="nofollow">http://scikit-learn.org/stable/auto_examples/index.html</a></p>]]></description>
	<dc:creator>Jitendra Prajapati</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34041/r-tuorial</guid>
	<pubDate>Mon, 31 Jul 2017 08:41:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34041/r-tuorial</link>
	<title><![CDATA[R tuorial]]></title>
	<description><![CDATA[<p>R learning resources</p>
<p>https://flowingdata.com/</p><p>Address of the bookmark: <a href="https://flowingdata.com/" rel="nofollow">https://flowingdata.com/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42672/introduction-to-bioinformatics-and-computational-biology</guid>
	<pubDate>Mon, 25 Jan 2021 01:32:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42672/introduction-to-bioinformatics-and-computational-biology</link>
	<title><![CDATA[Introduction to Bioinformatics and Computational Biology]]></title>
	<description><![CDATA[<p><span>This is the course material for STAT115/215 BIO/BST282 at Harvard University.</span></p>
<p>Xiaole Shirley Liu (lead instructor)<br>Joshua Starmer<br>Martin Hemberg<br>Ting Wang<br>Feng Yue</p>
<p>Ming Tang<br>Yang Liu<br>Jack Kang<br>Scarlett Ge<br>Jiazhen Rong<br>Phillip Nicol<br>Maartin De Vries</p>
<p>We thank many colleagues in the community, who helped Dr.&nbsp;Liu in prepare the STAT115/215 BIO/BST282 course over the years.&nbsp;</p><p>Address of the bookmark: <a href="https://liulab-dfci.github.io/bioinfo-combio/" rel="nofollow">https://liulab-dfci.github.io/bioinfo-combio/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43550/basic-structure-of-snakemake-pipeline-run</guid>
	<pubDate>Thu, 14 Oct 2021 07:01:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43550/basic-structure-of-snakemake-pipeline-run</link>
	<title><![CDATA[Basic Structure of Snakemake Pipeline Run !]]></title>
	<description><![CDATA[<div>/user/snakemake-demo$ ls</div><div>config.json data envs scripts slurm-240702.out Snakefile</div><ul>
<li>data = mock data for the snakefile to use</li>
<li>Snakefile = name of the snakemake &ldquo;formula&rdquo; file
<ul>
<li>Note: The default file that snakemake looks for in the current working directory is the&nbsp;<code>Snakefile</code>. If you would like to override that you can specify it following the&nbsp;<code>-s</code>
<ul>
<li><code>snakemake -s snakefile.py</code></li>
</ul>
</li>
</ul>
</li>
<li>envs = directory for storing the conda environments that the workflow will use.</li>
<li>scripts = directory for storing python scripts called by the snakemake formula.</li>
<li>config.json = json format file with extra parameters for our snakemake file to use.</li>
<li>cluster.json = json format file with specification for running on the HPC</li>
<li>samples.txt = file we will use later relating to the config.json file.</li>
</ul><p><span>Run the snakemake file as a dry run (the example workflow shown above).</span></p><ul>
<li>This will build a DAG of the jobs to be run without actually executing them.</li>
<li><code>snakemake --dry-run</code></li>
</ul><p>User can e<span>xecute rules of interest.</span></p><ul>
<li><code>snakemake --dry-run all</code>&nbsp;VS.&nbsp;<code>snakemake --dry-run call</code>&nbsp;VS.&nbsp;<code>snakemake --dry-run bwa</code></li>
</ul><p><span>Run the snakemake file in order to produce an image of the DAG of jobs to be run.</span></p><ul>
<li><code>snakemake --dag | dot -Tsvg &gt; dag.svg</code>&nbsp;OR&nbsp;<code>snakemake --dag | dot -Tsvg &gt; dag.svg</code></li>
</ul><p>Run the snakemake (this time not as a dry run)</p><ol>
<li><code>snakemake --use-conda</code></li>
</ol>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/43701/prepare-for-coding-interview</guid>
	<pubDate>Tue, 11 Jan 2022 06:14:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/43701/prepare-for-coding-interview</link>
	<title><![CDATA[Prepare for Coding Interview !]]></title>
	<description><![CDATA[<p><span>This is a comprehensive guide to prepare for your next coding interview. It's great for recent graduates and has questions and practice materials structured from traditional big tech interview formats.</span><br /><br /><span>While it does not include the latest developments in programming since 2019, it nails the core fundamentals in a very comprehensive and accessible way!</span><br /><br /><span>Credits to Kaiyu Zhang, with additional material in the appendix sourced from Reddit.</span></p><p>People say that interviews at Google will cover as much ground as possible. As a new college graduate, the ground that I must capture are the following. Part of the list is borrowed from a reddit post: https://www. reddit.com/r/cscareerquestions/comments/206ajq/my_onsite_interview_experience_at_google/ #bottom-comments.</p><p>1. Data structures</p><p>2. Trees and Graph algorithms</p><p>3. Dynamic Programming</p><p>4. Recursive algorithms</p><p>5. Scheduling algorithms (Greedy)</p><p>6. Caching 1</p><p>7. Sorting</p><p>8. Files</p><p>9. Computability</p><p>10. Bitwise operators</p><p>11. System design</p>]]></description>
	<dc:creator>Abhi</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/43701" length="745121" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44614/online-resources-on-must-read-papers-in-evolutionary-biology</guid>
	<pubDate>Fri, 26 Jul 2024 01:39:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44614/online-resources-on-must-read-papers-in-evolutionary-biology</link>
	<title><![CDATA[Online resources on must-read papers in evolutionary biology]]></title>
	<description><![CDATA[<pre>Online resources on must-read papers in evolutionary biology, for a literature club.<br /><br />Below is a summary of all answers that we received.

All the best,

Jana and Xiaoyan

1.       *Nick Barton:*

- The textbook "Evolution" by Nick Barton, with resources for
  exploring the literature: Barton, N. H., Briggs, D. E. G., Eisen, J.
  A., Goldstein, D. B., &amp; Patel, N. H. (2007). Evolution. Cold Spring
  Harbor Laboratory Press.

- Papers from a course named "Classics in Evolutionary Biology":

Evolutionary Synthesis
1. Haldane, J. B. S. 1932. The causes of evolution. Longmans. New York.
   (esp. Ch. IV).
2. Fisher, R. A. 1930. The genetical theory of natural selection. Oxford
   University Press, Oxford. Selected Sections - Fundamental Theorem.

Genetic Variation
1a. Lewontin, R. C., and J. L. Hubby. 1966. A molecular approach to
the study of genic heterozygosity in natural populations. II. Amount
of variation and degree of heterozygosity in natural populations of
Drosophila pseudoobscura. Genetics. 54:595-609.

1b. Sachidandam et al. 2001. A map of human genome sequence variation
containing 1.42 million single nucleotide polymorphisms. 409: 928-33.

2. Wright S., Dobzhansky T., Hovanitz W. 1942 Genetics of natural
populations VII The allelism of lethals in the third chromosome of
Drosophila pseudoobscura. Genetics 27: 363-394.

Recombination and evolution
1. Hill, W. G., and A. Robertson. 1966. The effect of linkage on limits
to artificial selection. Genet. Res. 8:269-294.

2. Maynard Smith and Haigh. 1974. The hitch-hiking effect of a favourable
gene. Genet. Res. 23: 23-35.

Understanding sequence variation
1. Begun D. J., Aquadro C. F., 1992 Levels of naturally occurring DNA
polymorphism correlate with recombination rate in Drosophila melanogaster.
Nature 356: 519-520.

2. Green R. E., Reich D., P&auml;&auml;bo S., 2010 A draft sequence of the
Neandertal genome. Science 328: 710-722.

Quantitative Genetics:  variation in complex traits
1. Galton F., 1877 Typical laws of heredity. Nature 15: 492-495-
512-514- 532-533.

2. Turelli M., 1984 Heritable genetic variation via
mutation-selection balance: Lerch's Zeta meets the abdominal
bristle. Theor. Popul. Biol. 25: 138-193.

Quantitative Genetics:  finding the genes
1. Shrimpton A. E., Robertson A., 1988 The Isolation of polygenic factors
controlling bristle score in Drosophila melanogaster II Distribution of
third chromosome bristle effects within chromosome sections. Genetics
118: 445-459.

2. Boyle E. A., Li Y. I., Pritchard J. K., 2017 An expanded view of
complex traits: from polygenic to omnigenic. Cell 169: 1177-1186.

Neutral Evolution
1. Kimura, M. 1968. Evolutionary rate at the molecular level. Science.
217:624-626.

2a. Kern A. D., Hahn M. W., 2018 The Neutral Theory in Light of Natural
Selection. Molecular Biology and Evolution 110: 21077-6.

2b. Jensen J. D., Payseur B. A., Stephan W., Aquadro C. F., Lynch M.,
Charlesworth D., Charlesworth B., 2018 The importance of the Neutral Theory
in 1968 and 50 years on: a response to Kern and Hahn 2018. Evolution 112:
2109-4.

2c. Ellegren &amp; Galtier. 2016. Determinants of genetic diversity. Nature
Reviews Genetics.

Mutation and Genetic Variability
1. Luria, S. E., and M. Delbr&uuml;ck. 1943. Mutations of Bacteria from Virus
Sensitivity to Virus Resistance. Genetics. 28(6):491-511.

2. Hill, W G. 1982. "Rates of Change in Quantitative Traits From Fixation
of New Mutations." Proceedings of the National Academy of Sciences (U.S.A.)
79: 142-45.

Testing for selection
1. McDonald &amp; Kreitman. 1991. Adaptive protein evolution at the Adh locus
in Drosophila. Nature.

2. Begun, et al. Mol. Biol. Evol. 16, 1816-1819 (1999).

3. Siddiq et al. 2016. Experimental test and refutation of a classic case
of molecular adaptation in Drosophila melanogaster.  Nature Ecology &amp;
Evolution.

The shifting balance
1. Wright, S. 1932. The roles of mutation, inbreeding, crossbreeding and
selection in evolution. Proceedings of the VI International Congress of
Genetics: 1. pp 356-366.

2. Coyne, J.A., N.H. Barton, and M. Turelli. 1997. A critique of Wright's
shifting balance theory of evolution.  Evolution 51: 643-671.

3. Barton. 2016. Sewall Wright on Evolution in Mendelian Populations and
the "Shifting Balance". Genetics.

Evolution of Sex
1.  Muller, H.J. 1964. The relation of recombination to mutational advance.
Mutation Res. 1(1):2-9

2. McDonald et al. 2016. Sex speeds adaptation by altering the dynamics of
molecular evolution. Nature.

Kin Selection, Cooperation, and Conflict
1. Hamilton, W. D. 1964. The genetical evolution of social behaviour I.
Journal of Theoretical Biology. 7:1-52.

2. Trivers, R. L. 1974 Parent-offspring conflict. American Zoologist.
14(1):249-264.

Sexual Selection
1. Zahavi, A. 1975. Mate selection - a selection of a handicap. J. Theor.
Biol. 53:205-214.

2. Kirkpatrick, M., and Ryan, M.J. 1991. The evolution of mating
preferences and the paradox of the lek. Nature. 350:33-38.

Fitness Landscapes
1. Dean, A. 1995. A Molecular Investigation of Genotype by Environment
Interactions. Genetics. 139:19-33.

2. Costanzo et al. 2010. The Genetic Landscape of a Cell. Science.

Speciation
1. Coyne, J. A., and H. A. Orr. 1989. Patterns of speciation in Drosophila.
Evolution. 43:362-381.

2. Corbett-Detig et al. 2013. Genetic incompatibilities are widespread
within species. Nature.

2.       *Marcos Antezana:*

Valen, L. v. 1975. Energy and Evolution. University of Chicago, Department
of Biology.

3.       *Remco Folkertsma:*

1. The work by Hopi Hoekstra on local adaptation and oldfield mice

2. Poelstra, J. W., Vijay, N., Bossu, C. M., Lantz, H., Ryll, B., M&uuml;ller,
I., ... &amp; Wolf, J. B. (2014). The genomic landscape underlying phenotypic
integrity in the face of gene flow in crows. Science, 344(6190), 1410-1414.

4.       *Joshka Kaufmann and Leslie Turner*

They offer us a link to 'papers every evolutionary biologist should read',
the papers are collected by Leslie Turner.
https://static1.squarespace.com/static/53e8cb7ce4b02c4bc3aeeee4/t/5ab8fcb670a6ad55c67fcdf4/1522072758665/EvoBioClassicsRefList.pdf

5.       *Sarah Stockwell*

Matt Ridley collected classic papers in evolutionary biology and printed
part of these papers in his book Evolution (see Matt Ridley. Evolution
(Univ. of Oxford Press, 2nd edition, 2004))
</pre>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35534/awk-for-bioinformatician-and-computational-biologist</guid>
	<pubDate>Tue, 06 Feb 2018 14:54:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35534/awk-for-bioinformatician-and-computational-biologist</link>
	<title><![CDATA[Awk for Bioinformatician and computational biologist]]></title>
	<description><![CDATA[<p>Awk is a programming language which allows easy manipulation of structured data and is mostly used for pattern scanning and processing. It searches one or more files to see if they contain lines that match with the specified patterns and then perform associated actions. The basic syntax is:</p><blockquote><p><br />awk '/pattern1/ {Actions}<br /> /pattern2/ {Actions}' file</p></blockquote><p><br />The working of Awk is as follows<br />Awk reads the input files one line at a time.<br />For each line, it matches with given pattern in the given order, if matches performs the corresponding action.<br />If no pattern matches, no action will be performed.<br />In the above syntax, either search pattern or action are optional, But not both.<br />If the search pattern is not given, then Awk performs the given actions for each line of the input.<br />If the action is not given, print all that lines that matches with the given patterns which is the default action.<br />Empty braces with out any action does nothing. It wont perform default printing operation.<br />Each statement in Actions should be delimited by semicolon.<br />Say you have data.tsv with the following contents:</p><p><br />$ cat data/test.tsv<br />contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2 ACTTTATATATT<br />contig3 ACTTATATATATATA<br />contig4 ACTTATATATATATA<br />contig5 ACTTTATATATT <br />By default Awk prints every line from the file.</p><p><br />$ awk '{print;}' data/test.tsv<br />contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2 ACTTTATATATT<br />contig3 ACTTATATATATATA<br />contig4 ACTTATATATATATA<br />contig5 ACTTTATATATT <br />We print the line which matches the pattern contig3</p><p><br />$ awk '/contig3/' data/test.tsv<br />contig3 ACTTATATATATATA<br />Awk has number of builtin variables. For each record i.e line, it splits the record delimited by whitespace character by default and stores it in the $n variables. If the line has 5 words, it will be stored in $1, $2, $3, $4 and $5. $0 represents the whole line. NF is a builtin variable which represents the total number of fields in a record.</p><p><br />$ awk '{print $1","$2;}' data/test.tsv<br />contig1,ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2,ACTTTATATATT<br />contig3,ACTTATATATATATA<br />contig4,ACTTATATATATATA<br />contig5,ACTTTATATATT</p><p>$ awk '{print $1","$NF;}' data/test.tsv<br />contig1,ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2,ACTTTATATATT<br />contig3,ACTTATATATATATA<br />contig4,ACTTATATATATATA<br />contig5,ACTTTATATATT</p><p><br />Awk has two important patterns which are specified by the keyword called BEGIN and END. The syntax is as follows:</p><blockquote><p>BEGIN { Actions before reading the file}<br />{Actions for everyline in the file} <br />END { Actions after reading the file }</p></blockquote><p><br />For example,<br />$ awk 'BEGIN{print "Header,Sequence"}{print $1","$2;}END{print "-------"}' data/test.tsv<br />Header,Sequence<br />contig1,ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2,ACTTTATATATT<br />contig3,ACTTATATATATATA<br />contig4,ACTTATATATATATA<br />contig5,ACTTTATATATT<br />------- <br />We can also use the concept of a conditional operator in print statement of the form print CONDITION ? PRINT_IF_TRUE_TEXT : PRINT_IF_FALSE_TEXT. For example, in the code below, we identify sequences with lengths &gt; 14:</p><p>$ awk '{print (length($2)&gt;14) ? $0"&gt;14" : $0"&lt;=14";}' data/test.tsv<br />contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG&gt;14<br />contig2 ACTTTATATATT&lt;=14<br />contig3 ACTTATATATATATA&gt;14<br />contig4 ACTTATATATATATA&gt;14<br />contig5 ACTTTATATATT&lt;=14<br />We can also use 1 after the last block {} to print everything (1 is a shorthand notation for {print $0} which becomes {print} as without any argument print will print $0 by default), and within this block, we can change $0, for example to assign the first field to $0 for third line (NR==3), we can use:</p><p>$ awk 'NR==3{$0=$1}1' data/test.tsv<br />contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2 ACTTTATATATT<br />contig3<br />contig4 ACTTATATATATATA<br />contig5 ACTTTATATATT<br />You can have as many blocks as you want and they will be executed on each line in the order they appear, for example, if we want to print $1 three times (here we are using printf instead of print as the former doesn't put end-of-line character),</p><p>$ awk '{printf $1"\t"}{printf $1"\t"}{print $1}' data/test.tsv<br />contig1 contig1 contig1<br />contig2 contig2 contig2<br />contig3 contig3 contig3<br />contig4 contig4 contig4<br />contig5 contig5 contig5 <br />Although, we can also skip executing later blocks for a given line by using next keyword:</p><p>$ awk '{printf $1"\t"}NR==3{print "";next}{print $1}' data/test.tsv<br />contig1 contig1<br />contig2 contig2<br />contig3 <br />contig4 contig4<br />contig5 contig5</p><p>$ awk 'NR==3{print "";next}{printf $1"\t"}{print $1}' data/test.tsv<br />contig1 contig1<br />contig2 contig2</p><p>contig4 contig4<br />contig5 contig5<br />You can also use getline to load the contents of another file in addition to the one you are reading, for example, in the statement given below, the while loop will load each line from test.tsv into k until no more lines are to be read:</p><p>$ awk 'BEGIN{while((getline k &lt;"data/test.tsv")&gt;0) print "BEGIN:"k}{print}' data/test.tsv<br />BEGIN:contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />BEGIN:contig2 ACTTTATATATT<br />BEGIN:contig3 ACTTATATATATATA<br />BEGIN:contig4 ACTTATATATATATA<br />BEGIN:contig5 ACTTTATATATT<br />contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2 ACTTTATATATT<br />contig3 ACTTATATATATATA<br />contig4 ACTTATATATATATA<br />contig5 ACTTTATATATT <br />You can also store data in the memory with the syntax VARIABLE_NAME[KEY]=VALUE which you can later use through for (INDEX in VARIABLE_NAME) command:</p><p>$ awk '{i[$1]=1}END{for (j in i) print j"&lt;="i[j]}' data/test.tsv<br />contig1&lt;=1<br />contig2&lt;=1<br />contig3&lt;=1<br />contig4&lt;=1<br />contig5&lt;=1</p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

</channel>
</rss>