<?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/36884?offset=140</link>
	<atom:link href="https://bioinformaticsonline.com/related/36884?offset=140" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32131/wgs-celera-assembler-version-83rc2</guid>
	<pubDate>Mon, 10 Apr 2017 04:45:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32131/wgs-celera-assembler-version-83rc2</link>
	<title><![CDATA[WGS Celera Assembler version 8.3rc2]]></title>
	<description><![CDATA[<p>These are release notes for Celera Assembler version 8.3rc2, which was released on May 24, 2015.<br><br>This distribution package provides a stable, tested, documented version of the software.&nbsp; The distribution is usable on most Unix-like platforms, and some platforms have pre-compiled binary distributions ready for installation.<br><br>The source code package includes full source code (revision 4627), Makefiles, and scripts.&nbsp; A subset of the kmer package (http://kmer.sourceforge.net/, version r1994), used by some modules of Celera Assembler, is included.&nbsp; This distribution includes [http://samtools.sourceforge.net/ SAMtools], [http://www.cbcb.umd.edu/software/jellyfish/ Jellyfish 2.0], [https://github.com/pbjd/pbutgcns PBUTGCNS], [https://github.com/PacificBiosciences/pbdagcon PBDAGCON], [https://github.com/PacificBiosciences/BLASR BLASR], and parts of the [https://github.com/PacificBiosciences/FALCON/tree/v0.1.3 Falcon assembler].<br><br>Full documentation can be found online at http://wgs-assembler.sourceforge.net/.</p>
<p>Interesting scripts within it</p>
<p>urbe@urbo214b[bin] ls&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; []<br>-rwxrwxr-x 1 urbe urbe&nbsp; 11K Apr 10 11:41 addCNSToStore<br>-rwxrwxr-x 1 urbe urbe 575K Apr 10 11:41 addReadsToUnitigs<br>-rwxrwxr-x 1 urbe urbe 128K Apr 10 11:41 analyzeBest<br>-rwxrwxr-x 1 urbe urbe 257K Apr 10 11:41 analyzePosMap<br>-rwxrwxr-x 1 urbe urbe 1,5M Apr 10 11:41 analyzeScaffolds<br>-rwxrwxr-x 1 urbe urbe 224K Apr 10 11:41 asmOutputFasta<br>-rwxrwxr-x 1 urbe urbe 448K Apr 10 11:41 asmOutputStatistics<br>-rwxrwxr-x 1 urbe urbe 2,4K Apr 10 11:41 asmToAGP.pl<br>-rwxrwxr-x 1 urbe urbe 7,6M Apr 10 11:41 blasr<br>-rwxrwxr-x 1 urbe urbe 1,6M Apr 10 11:41 bogart<br>-rwxrwxr-x 1 urbe urbe 183K Apr 10 11:41 bogus<br>-rwxrwxr-x 1 urbe urbe 272K Apr 10 11:41 bogusness<br>-rwxrwxr-x 1 urbe urbe 247K Apr 10 11:41 buildPosMap<br>-rwxrwxr-x 1 urbe urbe 213K Apr 10 11:41 buildRefContigs<br>-rwxrwxr-x 1 urbe urbe 990K Apr 10 11:41 buildUnitigs<br>-rwxrwxr-x 1 urbe urbe&nbsp; 18K Apr 10 11:41 ca2ace.pl<br>-rwxrwxr-x 1 urbe urbe&nbsp; 12K Apr 10 11:41 caqc_help.ini<br>-rwxrwxr-x 1 urbe urbe&nbsp; 61K Apr 10 11:41 caqc.pl<br>-rwxrwxr-x 1 urbe urbe&nbsp; 23K Apr 10 11:41 cat-corrects<br>-rwxrwxr-x 1 urbe urbe&nbsp; 24K Apr 10 11:41 cat-erates<br>-rwxrwxr-x 1 urbe urbe 1,9M Apr 10 11:41 cgw<br>-rwxrwxr-x 1 urbe urbe 1,4M Apr 10 11:41 cgwDump<br>-rwxrwxr-x 1 urbe urbe 204K Apr 10 11:41 chimChe<br>-rwxrwxr-x 1 urbe urbe 201K Apr 10 11:40 chimera<br>-rwxrwxr-x 1 urbe urbe 220K Apr 10 11:41 classifyMates<br>-rwxrwxr-x 1 urbe urbe 201K Apr 10 11:41 classifyMatesApply<br>-rwxrwxr-x 1 urbe urbe 215K Apr 10 11:41 classifyMatesPairwise<br>-rwxrwxr-x 1 urbe urbe 366K Apr 10 11:41 computeCoverageStat<br>-rwxrwxr-x 1 urbe urbe 9,8K Apr 10 11:41 convert-fasta-to-v2.pl<br>-rwxrwxr-x 1 urbe urbe&nbsp; 48K Apr 10 11:41 convertOverlap<br>-rwxrwxr-x 1 urbe urbe 119K Apr 10 11:41 convertSamToCA<br>-rwxrwxr-x 1 urbe urbe&nbsp; 20K Apr 10 11:41 convertToPBCNS<br>-rwxrwxr-x 1 urbe urbe 197K Apr 10 11:41 correct-frags<br>-rwxrwxr-x 1 urbe urbe 259K Apr 10 11:41 correct-olaps<br>-rwxrwxr-x 1 urbe urbe 520K Apr 10 11:41 correctPacBio<br>-rwxrwxr-x 1 urbe urbe 540K Apr 10 11:41 ctgcns<br>-rwxrwxr-x 1 urbe urbe 162K Apr 10 11:40 deduplicate<br>-rwxrwxr-x 1 urbe urbe&nbsp; 37K Apr 10 11:41 demotePosMap<br>-rwxrwxr-x 1 urbe urbe 1,5M Apr 10 11:41 dumpCloneMiddles<br>-rwxrwxr-x 1 urbe urbe 124K Apr 10 11:41 dumpPBRLayoutStore<br>-rwxrwxr-x 1 urbe urbe 1,3M Apr 10 11:41 dumpSingletons<br>-rwxrwxr-x 1 urbe urbe 171K Apr 10 11:41 erate-estimate<br>-rwxrwxr-x 1 urbe urbe 221K Apr 10 11:40 estimate-mer-threshold<br>-rwxrwxr-x 1 urbe urbe 1,5M Apr 10 11:41 extendClearRanges<br>-rwxrwxr-x 1 urbe urbe 1,3M Apr 10 11:41 extendClearRangesPartition<br>-rwxrwxr-x 1 urbe urbe 205K Apr 10 11:40 extractmessages<br>-rwxrwxr-x 1 urbe urbe 7,2M Apr 10 11:41 falcon_sense<br>-rwxrwxr-x 1 urbe urbe 9,8K Apr 10 11:41 fastaToCA<br>-rwxrwxr-x 1 urbe urbe 124K Apr 10 11:40 fastqAnalyze<br>-rwxrwxr-x 1 urbe urbe 137K Apr 10 11:40 fastqSample<br>-rwxrwxr-x 1 urbe urbe&nbsp; 62K Apr 10 11:40 fastqSimulate<br>-rwxrwxr-x 1 urbe urbe 121K Apr 10 11:40 fastqSimulate-sort<br>-rwxrwxr-x 1 urbe urbe 246K Apr 10 11:40 fastqToCA<br>-rwxrwxr-x 1 urbe urbe 140K Apr 10 11:41 filterOverlap<br>-rwxrwxr-x 1 urbe urbe 341K Apr 10 11:40 finalTrim<br>-rwxrwxr-x 1 urbe urbe 228K Apr 10 11:41 fixUnitigs<br>-rwxrwxr-x 1 urbe urbe 147K Apr 10 11:40 fragmentDepth<br>-rwxrwxr-x 1 urbe urbe&nbsp; 29K Apr 10 11:41 fragsInVars<br>-rwxrwxr-x 1 urbe urbe 545K Apr 10 11:41 frgs2clones<br>-rwxrwxr-x 1 urbe urbe 398K Apr 10 11:40 gatekeeper<br>-rwxrwxr-x 1 urbe urbe 139K Apr 10 11:40 gatekeeperbench<br>-rwxrwxr-x 1 urbe urbe 167K Apr 10 11:40 gkpStoreCreate<br>-rwxrwxr-x 1 urbe urbe 147K Apr 10 11:40 gkpStoreDumpFASTQ<br>-rwxrwxr-x 1 urbe urbe 184K Apr 10 11:41 greedyFragmentTiling<br>-rwxrwxr-x 1 urbe urbe 1,6K Apr 10 11:41 greedy_layout_to_IUM<br>-rwxrwxr-x 1 urbe urbe 142K Apr 10 11:40 initialTrim<br>-rwxrwxr-x 1 urbe urbe 967K Apr 10 11:41 jellyfish<br>-rwxrwxr-x 1 urbe urbe 219K Apr 10 11:41 markRepeatUnique<br>-rwxrwxr-x 1 urbe urbe 273K Apr 10 11:40 markUniqueUnique<br>-rwxrwxr-x 1 urbe urbe 114K Apr 10 11:40 mercy<br>-rwxrwxr-x 1 urbe urbe 3,8K Apr 10 11:41 mergeqc.pl<br>-rwxrwxr-x 1 urbe urbe 422K Apr 10 11:40 merTrim<br>-rwxrwxr-x 1 urbe urbe 125K Apr 10 11:40 merTrimApply<br>-rwxrwxr-x 1 urbe urbe 376K Apr 10 11:40 meryl<br>-rwxrwxr-x 1 urbe urbe 176K Apr 10 11:41 metagenomics_ovl_analyses<br>-rwxrwxr-x 1 urbe urbe 297K Apr 10 11:41 olap-from-seeds<br>-rwxrwxr-x 1 urbe urbe 275K Apr 10 11:41 outputLayout<br>-rwxrwxr-x 1 urbe urbe 229K Apr 10 11:41 overlapInCore<br>-rwxrwxr-x 1 urbe urbe 144K Apr 10 11:40 overlap_partition<br>-rwxrwxr-x 1 urbe urbe 179K Apr 10 11:41 overlapStats<br>-rwxrwxr-x 1 urbe urbe 179K Apr 10 11:41 overlapStore<br>-rwxrwxr-x 1 urbe urbe 153K Apr 10 11:41 overlapStoreBucketizer<br>-rwxrwxr-x 1 urbe urbe 175K Apr 10 11:41 overlapStoreBuild<br>-rwxrwxr-x 1 urbe urbe&nbsp; 33K Apr 10 11:41 overlapStoreIndexer<br>-rwxrwxr-x 1 urbe urbe&nbsp; 48K Apr 10 11:41 overlapStoreSorter<br>-rwxrwxr-x 1 urbe urbe 604K Apr 10 11:40 overmerry<br>lrwxrwxrwx 1 urbe urbe&nbsp;&nbsp;&nbsp; 4 Apr 10 11:41 pacBioToCA -&gt; PBcR<br>-rwxrwxr-x 1 urbe urbe 131K Apr 10 11:41 PBcR<br>-rwxrwxr-x 1 urbe urbe 2,9M Apr 10 11:41 pbdagcon<br>-rwxrwxr-x 1 urbe urbe 1,9M Apr 10 11:41 pbutgcns<br>-rwxrwxr-x 1 urbe urbe 201K Apr 10 11:40 remove_fragment<br>-rwxrwxr-x 1 urbe urbe 153K Apr 10 11:40 removeMateOverlap<br>-rwxrwxr-x 1 urbe urbe 2,5K Apr 10 11:41 replaceUIDwithName-fastq<br>-rwxrwxr-x 1 urbe urbe 1,2K Apr 10 11:41 replaceUIDwithName-posmap<br>-rwxrwxr-x 1 urbe urbe 1,3M Apr 10 11:41 resolveSurrogates<br>-rwxrwxr-x 1 urbe urbe 139K Apr 10 11:41 rewriteCache<br>-rwxrwxr-x 1 urbe urbe 232K Apr 10 11:41 runCA<br>-rwxrwxr-x 1 urbe urbe&nbsp; 88K Apr 10 11:41 runCA-dedupe<br>-rwxrwxr-x 1 urbe urbe&nbsp; 14K Apr 10 11:41 runCA-overlapStoreBuild<br>-rwxrwxr-x 1 urbe urbe 3,6K Apr 10 11:41 run_greedy.csh<br>-rwxrwxr-x 1 urbe urbe 297K Apr 10 11:40 sffToCA<br>-rwxrwxr-x 1 urbe urbe&nbsp; 13K Apr 10 11:40 show-corrects<br>-rwxrwxr-x 1 urbe urbe 557K Apr 10 11:41 splitUnitigs<br>-rwxrwxr-x 1 urbe urbe 1,4M Apr 10 11:41 terminator<br>drwxrwxr-x 2 urbe urbe 4,0K Apr 10 11:41 TIGR<br>-rwxrwxr-x 1 urbe urbe 526K Apr 10 11:41 tigStore<br>-rwxrwxr-x 1 urbe urbe&nbsp; 35K Apr 10 11:41 tracearchiveToCA<br>-rwxrwxr-x 1 urbe urbe&nbsp; 35K Apr 10 11:41 tracedb-to-frg.pl<br>-rwxrwxr-x 1 urbe urbe&nbsp; 44K Apr 10 11:41 trimFastqByQVWindow<br>-rwxrwxr-x 1 urbe urbe&nbsp; 18K Apr 10 11:40 uidclient<br>-rwxrwxr-x 1 urbe urbe 589K Apr 10 11:41 unitigger<br>-rwxrwxr-x 1 urbe urbe&nbsp; 42K Apr 10 11:40 upgrade-v8-to-v9<br>-rwxrwxr-x 1 urbe urbe&nbsp; 42K Apr 10 11:40 upgrade-v9-to-v10<br>-rwxrwxr-x 1 urbe urbe&nbsp; 854 Apr 10 11:41 utg2fasta<br>-rwxrwxr-x 1 urbe urbe 731K Apr 10 11:41 utgcns<br>-rwxrwxr-x 1 urbe urbe 561K Apr 10 11:41 utgcnsfix<br><br><br></p><p>Address of the bookmark: <a href="http://wgs-assembler.sourceforge.net/wiki/index.php/Main_Page" rel="nofollow">http://wgs-assembler.sourceforge.net/wiki/index.php/Main_Page</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33011/grinder-biogrinder-a-versatile-omics-shotgun-and-amplicon-sequencing-read-simulator</guid>
	<pubDate>Wed, 24 May 2017 08:41:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33011/grinder-biogrinder-a-versatile-omics-shotgun-and-amplicon-sequencing-read-simulator</link>
	<title><![CDATA[Grinder / Biogrinder - A versatile omics shotgun and amplicon sequencing read simulator]]></title>
	<description><![CDATA[<p><span>Grinder is a versatile program to create random shotgun and amplicon sequence libraries based on DNA, RNA or proteic reference sequences provided in a FASTA file. </span></p>
<p><span>Grinder can produce genomic, metagenomic, transcriptomic, metatranscriptomic, proteomic, metaproteomic shotgun and amplicon datasets from current sequencing technologies such as Sanger, 454, Illumina. These simulated datasets can be used to test the accuracy of bioinformatic tools under specific hypothesis, e.g. with or without sequencing errors, or with low or high community diversity. Grinder may also be used to help decide between alternative sequencing methods for a sequence-based project, e.g. should the library be paired-end or not, how many reads should be sequenced.</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/biogrinder/files/biogrinder/" rel="nofollow">https://sourceforge.net/projects/biogrinder/files/biogrinder/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43048/coverm-read-coverage-calculator-for-metagenomics</guid>
	<pubDate>Thu, 29 Apr 2021 23:39:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43048/coverm-read-coverage-calculator-for-metagenomics</link>
	<title><![CDATA[CoverM: Read coverage calculator for metagenomics]]></title>
	<description><![CDATA[<p>CoverM aims to be a configurable, easy to use and fast DNA read coverage and relative abundance calculator focused on metagenomics applications.</p>
<p>CoverM calculates coverage of genomes/MAGs&nbsp;<code>coverm genome</code>&nbsp;(<a href="https://wwood.github.io/CoverM/coverm-genome.html">help</a>) or individual contigs&nbsp;<code>coverm contig</code>&nbsp;(<a href="https://wwood.github.io/CoverM/coverm-contig.html">help</a>). Calculating coverage by read mapping, its input can either be BAM files sorted by reference, or raw reads and reference genomes in various formats.</p><p>Address of the bookmark: <a href="https://github.com/wwood/CoverM" rel="nofollow">https://github.com/wwood/CoverM</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38172/bamview-a-free-interactive-display-of-read-alignments-in-bam-data-files</guid>
	<pubDate>Fri, 09 Nov 2018 13:43:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38172/bamview-a-free-interactive-display-of-read-alignments-in-bam-data-files</link>
	<title><![CDATA[BamView: a free interactive display of read alignments in BAM data files]]></title>
	<description><![CDATA[<p>To run the application on UNIX from the downloaded jar file run the UNIX:</p>
<p><tt>java -mx512m -jar BamView.jar</tt></p>
<p>and extra command line options are given when '-h' is used:</p>
<p><tt>java -jar BamView.jar -h</tt></p>
<p>BAM files can be specified on the command line with the '-a' option:</p>
<p><tt>java -mx512m -jar BamView.jar -a pathToFile/sorted.bam</tt></p>
<p>If a BAM filename is not given on the command line BamView will prompt for a file to be entered. The BAM index file should have the same name as the BAM file but with a '.bai' suffix. Multiple BAM files can be loaded and overlaid in the viewer. To make this easier BamView will read in files that contain a list of filenames.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://bamview.sourceforge.net/" rel="nofollow">http://bamview.sourceforge.net/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43983/must-read-paper-and-books-in-evolution-biology</guid>
	<pubDate>Wed, 05 Oct 2022 18:33:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43983/must-read-paper-and-books-in-evolution-biology</link>
	<title><![CDATA[Must read paper and books in evolution biology !]]></title>
	<description><![CDATA[<pre>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>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</guid>
	<pubDate>Tue, 17 Apr 2018 16:21:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</link>
	<title><![CDATA[AlignGraph: algorithm for secondary de novo genome assembly guided by closely related references]]></title>
	<description><![CDATA[<p>AlignGraph is a software that extends and joins contigs or scaffolds by reassembling them with help provided by a reference genome of a closely related organism.</p>
<p>Using AlignGraph</p>
<pre><code>AlignGraph --read1 reads_1.fa --read2 reads_2.fa --contig contigs.fa --genome genome.fa --distanceLow distanceLow --distanceHigh distancehigh --extendedContig extendedContigs.fa --remainingContig remainingContigs.fa [--kMer k --insertVariation insertVariation --coverage coverage --part p --fastMap --ratioCheck --iterativeMap --misassemblyRemoval --resume]</code></pre>
<h3>&nbsp;</h3><p>Address of the bookmark: <a href="https://github.com/baoe/AlignGraph" rel="nofollow">https://github.com/baoe/AlignGraph</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38445/orthoani-an-improved-algorithm-and-software-for-calculating-average-nucleotide-identity</guid>
	<pubDate>Wed, 12 Dec 2018 08:36:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38445/orthoani-an-improved-algorithm-and-software-for-calculating-average-nucleotide-identity</link>
	<title><![CDATA[OrthoANI: An improved algorithm and software for calculating average nucleotide identity]]></title>
	<description><![CDATA[<p><span>OAT uses OrthoANI to measure the overall similarity between two genome sequences. ANI and OrthoANI are comparable algorithms: they share the same species demarcation cut-off at 95~96% and large comparison studies have demonstrated both algorithms to produce near identical reciprocal similarities. Details of the OrthoANI algorithm is given in (Lee et al. 2015). OAT employs an easy-to-follow Graphical User Interface that allow researchers to calculate OrthoANI values between genomes of interest without unfamiliar Command Line Environments. Moreover, the OAT_cmd command-line software can be integrated into preexisting bioinformatics pipelines.&nbsp;</span></p><p>Address of the bookmark: <a href="https://www.ezbiocloud.net/tools/orthoani" rel="nofollow">https://www.ezbiocloud.net/tools/orthoani</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41910/the-wavefront-alignment-wfa-algorithm</guid>
	<pubDate>Sun, 28 Jun 2020 10:17:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41910/the-wavefront-alignment-wfa-algorithm</link>
	<title><![CDATA[The wavefront alignment (WFA) algorithm]]></title>
	<description><![CDATA[<p><span>The wavefront alignment (WFA) algorithm is an exact gap-affine algorithm that takes advantage of</span><br><span>homologous regions between the sequences to accelerate the alignment process. As opposed to traditional dynamic programming algorithms that run in quadratic time, the WFA runs in time O(ns), proportional to the read length n and the alignment score s, using O(s^2) memory. Moreover, the WFA exhibits simple data dependencies that can be easily vectorized, even by the automatic features of modern compilers, for different architectures, without the need to adapt the code.</span></p><p>Address of the bookmark: <a href="https://github.com/smarco/WFA" rel="nofollow">https://github.com/smarco/WFA</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34565/fogsaa-fast-optimal-global-sequence-alignment-algorithm</guid>
	<pubDate>Fri, 08 Dec 2017 14:41:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34565/fogsaa-fast-optimal-global-sequence-alignment-algorithm</link>
	<title><![CDATA[FOGSAA: Fast Optimal Global Sequence Alignment Algorithm]]></title>
	<description><![CDATA[<p>Sequence alignment algorithms are widely used to infer similarirty and the point of differences between pair of sequences. FOGSAA is a fast Global alignment algorithm. It is basically a branch and bound approach which starts branch expansion in a greedy way taking the symbols from the given pair of sequences (protein or nucleotide) and results in an optimal alignment faster than conventional dymanic programming techniques. It is also better than the heuristic methods with respect to alignment quality.</p><p>Address of the bookmark: <a href="http://www.isical.ac.in/~bioinfo_miu/FOGSAA.htm" rel="nofollow">http://www.isical.ac.in/~bioinfo_miu/FOGSAA.htm</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34292/automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</guid>
	<pubDate>Mon, 13 Nov 2017 05:10:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34292/automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</link>
	<title><![CDATA[Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data]]></title>
	<description><![CDATA[<p><span>Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data</span><br><code>AfterQC</code><span>&nbsp;can simply go through all fastq files in a folder and then output three folders:&nbsp;</span><span>good</span><span>,&nbsp;</span><span>bad</span><span>&nbsp;and&nbsp;</span><span>QC</span><span>&nbsp;folders, which contains good reads, bad reads and the QC results of each fastq file/pair.</span><br><span>Currently it supports processing data from HiSeq 2000/2500/3000/4000, Nextseq 500/550, MiniSeq...and other&nbsp;</span><a href="http://support.illumina.com/help/SequencingAnalysisWorkflow/Content/Vault/Informatics/Sequencing_Analysis/CASAVA/swSEQ_mCA_FASTQFiles.htm">Illumina 1.8 or newer formats</a></p><p>Address of the bookmark: <a href="https://github.com/OpenGene/AfterQC" rel="nofollow">https://github.com/OpenGene/AfterQC</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>