<?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/30149?offset=470</link>
	<atom:link href="https://bioinformaticsonline.com/related/30149?offset=470" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22040/karpagam-university-coimbatore-of-sr-prof-prof-associate-and-assistant-professors-karpagam-university-coimbatore-coimbatore-tamil-nadu</guid>
  <pubDate>Thu, 16 Apr 2015 00:30:45 -0500</pubDate>
  <link></link>
  <title><![CDATA[Karpagam University, Coimbatore, of Sr. Prof, Prof, Associate and Assistant Professors Karpagam University, Coimbatore - Coimbatore, Tamil Nadu]]></title>
  <description><![CDATA[
<p>Karpagam University, Coimbatore, Recruitment of Sr. Prof, Prof, Associate and Assistant Professors</p>

<p>Name of the College: Karpagam University, Coimbatore</p>

<p>Date of official publication: 15th April 2015</p>

<p>The newspaper wherein this job advertised: The Hindu Newspaper</p>

<p>Name of the posts: Senior Professors, Professors, Associate Professors and Assistant Professors</p>

<p>Departments:<br />Bioinformatics<br />Biotechnology<br />Qualifications/Eligibility: The candidates should have qualifications as M.E/M.Tech/M.A/M.Com/MBA/M.Sc/M.Phil/NET/SLET/Ph.D</p>

<p>Job Location: Coimbatore, TN</p>

<p>Salary: As per college norms</p>

<p>How to apply: Interested and eligible candidates are requested to apply online at http://www.karpagamuniversity.edu.in/career</p>

<p>Last date: As soon as possible from 15th April 2015</p>

<p>Reference: The Hindu Newspaper dated 15-04-2015, Coimbatore edition on 14th page</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45358/the-variant-everyone-ignored</guid>
	<pubDate>Mon, 05 Oct 2026 12:14:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45358/the-variant-everyone-ignored</link>
	<title><![CDATA[The Variant Everyone Ignored]]></title>
	<description><![CDATA[<p>Consider a scenario in which a patient's genome has been sequenced. Among billions of DNA bases, a structural alteration may explain the patient's disease. Multiple advanced algorithms analyze the data, yet only one detects the variant, while the others do not. In standard bioinformatics workflows, such a solitary result is often regarded as unreliable and subsequently discarded. Although the solution exists within the data, prevailing computational protocols may overlook it.</p><p>A recent study published in Genome Biology (https://link.springer.com/article/10.1186/s13059-026-04280-y) addressed this challenge by introducing dicast (https://github.com/burgshrimps/dicast), a machine-learning approach for detecting structural variants in short-read sequencing data. Structural variants, such as large deletions, insertions, duplications, and inversions, can have significant biological and clinical implications, yet they are challenging to identify with short-read technologies. Because different detection methods frequently yield divergent results, researchers commonly employ consensus calling, considering a variant valid only if multiple tools detect it. While this approach reduces false positives, it relies on the potentially flawed assumption that the majority is always correct.</p><p>The researchers explored the impact of evaluating the supporting evidence for each variant, rather than simply tallying the number of algorithms that identified it. To establish a ground truth, they analyzed nine genomes using multiple sequencing technologies and 15 detection methods, initially identifying approximately 35 million potential variants. Through extensive filtering, evidence integration, and manual review of over 11,500 variants, they developed a robust benchmark comprising more than 236,000 structural variants. The findings underscored the complexity of the problem: short-read methods detected fewer than half of deletions and less than 10 percent of insertions, with performance declining markedly in repetitive genomic regions. In contrast, long-read technologies demonstrated superior detection capabilities. However, replacing the substantial volume of existing short-read data in clinical and research settings is not immediately feasible. Consequently, the researchers questioned whether short-read data might harbor more information than conventional analytical pipelines currently extract.</p><p>This line of inquiry led to the development of dicast. Rather than merely confirming agreement among multiple tools, dicast identifies patterns in sequencing data, including split and clipped reads, discordant read pairs, alignment characteristics, and the surrounding genomic context. An XGBoost machine-learning model evaluates which combinations of these signals are indicative of genuine structural variants. Thus, the approach shifts from tallying algorithmic consensus to interpreting the underlying evidence.</p><p>The researchers subsequently conducted a targeted evaluation by examining structural variants detected by only a single short-read tool, which are typically missed by consensus-based approaches. dicast successfully recovered approximately 81% of these single-caller deletions, insertions, and duplications. The signals for these variants were present in the data, but conventional filtering methods failed to integrate them effectively.</p><p>The utility of dicast was further demonstrated in cohorts with rare diseases, including congenital limb malformations, atrial fibrillation, and neuromuscular disorders. In one instance, dicast achieved a deletion recall rate of approximately 0.96, compared to 0.74 using consensus calling. The median number of variants requiring manual review was 29 per sample. Among 31 experimentally validated variants that standard filters would have missed, dicast identified 12, whereas consensus calling detected only one.</p><p>Overall, dicast identified approximately 20 percent more potential disease-causing deletions than consensus-based methods. While a 20 percent increase may appear modest, in clinical genomics such improvements can have significant practical implications. Missing a deletion may leave a case unresolved, whereas detecting a structural variant can provide critical diagnostic insights.</p><p>The study does not claim that machine learning has rendered short-read sequencing superior to long-read approaches. Instead, the results underscore the effectiveness of long-read sequencing for structural variant detection. However, dicast highlights a more nuanced perspective: substantial biological information may still be recoverable from the extensive short-read datasets already available.</p><p>The principal lesson extends beyond the detection of structural variants. For many years, bioinformatics pipelines have relied on threshold-based criteria, such as minimum coverage, quality scores, or support from multiple tools. While these rules are useful, biological phenomena do not always conform to rigid checklists; multiple weak signals, when considered collectively, can provide compelling evidence.</p><p>This perspective prompts consideration of the solitary variant: one algorithm identifies it, while several others do not. Traditional consensus techniques might have dismissed it, yet machine learning approaches evaluate the available evidence to determine whether the variant is plausible.</p><p>Occasionally, the most significant variant within a genome is the one that is almost universally overlooked.</p><p>Read more at&nbsp;https://link.springer.com/article/10.1186/s13059-026-04280-y</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/22053/binc-sample-question-paper</guid>
	<pubDate>Thu, 16 Apr 2015 09:16:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/22053/binc-sample-question-paper</link>
	<title><![CDATA[BINC Sample Question Paper !!!]]></title>
	<description><![CDATA[<p>BINC sample question paper. Wish you all the best for BINC examination.</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/22053" length="4041" type="text/plain" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36632/tulip-the-uncorrected-long-read-integration-pipeline</guid>
	<pubDate>Tue, 15 May 2018 09:06:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36632/tulip-the-uncorrected-long-read-integration-pipeline</link>
	<title><![CDATA[TULIP - The Uncorrected Long read Integration Pipeline]]></title>
	<description><![CDATA[TULIP currently consists of two Perl scripts, tulipseed.perl and tulipbulb.perl. These are very much intended as prototypes, and additional components and/or implementations are likely to follow.

Tulipseed takes as input alignments files of long reads to sparse short seeds, and outputs a graph and scaffold structures.<p>Address of the bookmark: <a href="https://github.com/Generade-nl/TULIP" rel="nofollow">https://github.com/Generade-nl/TULIP</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/22133/r-320-is-released</guid>
	<pubDate>Sat, 18 Apr 2015 05:06:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/22133/r-320-is-released</link>
	<title><![CDATA[R 3.2.0 is released]]></title>
	<description><![CDATA[<p>R 3.2.0 (codename &ldquo;Full of Ingredients&rdquo;)&nbsp;was <a href="http://r.789695.n4.nabble.com/R-3-2-0-is-released-td4705933.html" target="_blank">released yesterday</a>.&nbsp;You can get the latest binaries version <strong><a href="http://cran.rstudio.com/" target="_blank">from here</a>.</strong>&nbsp;(or the .tar.gz&nbsp;<strong>source</strong> code from <a href="http://cran.r-project.org/src/base/R-3/R-3.2.0.tar.gz" target="_blank">here</a>).&nbsp;The full list of new features and bug fixes is provided below.</p><h3>Upgrading to R 3.2.0 on Windows</h3><p>If you are using <strong>Windows&nbsp;</strong>you can easily upgrade to the latest version of R using <a href="http://cran.r-project.org/web/packages/installr/" target="_blank">the installr package</a>. Simply run the following code:</p><div><table>
<tbody>
<tr id="p612572">
<td id="p61257code2">
<pre><span style="color: #228b22;"># installing/loading the latest installr package:</span>
<span style="color: #0000ff; font-weight: bold;">install.<span>packages</span></span><span style="color: #080;">(</span><span style="color: #ff0000;">"installr"</span><span style="color: #080;">)</span><span style="color: #080;">;</span> <span style="color: #0000ff; font-weight: bold;">library</span><span style="color: #080;">(</span>installr<span style="color: #080;">)</span> <span style="color: #228b22;">#load / install+load installr</span>
&nbsp;
updateR<span style="color: #080;">(</span><span style="color: #080;">)</span> <span style="color: #228b22;"># updating R.</span></pre>
</td>
</tr>
</tbody>
</table></div><p><span>Running &ldquo;updateR()&rdquo; will detect if there is a new R version available, and if so it will download+install it (etc.).</span></p><p><span><strong>If you are an R blogger yourself</strong> you are invited to <a href="http://www.r-bloggers.com/add-your-blog/">add your own R content feed to this site</a> (<strong>Non-English</strong> R bloggers should add themselves- <a href="http://www.r-bloggers.com/lang/add-your-blog">here</a>)</span></p><h4>NEW FEATURES</h4><ul>
<li><code>anyNA()</code> gains a <code>recursive</code> argument.</li>
<li>When <code>x</code> is missing and <code>names</code> is not false (including the default value), <code>Sys.getenv(x, names)</code> returns an object of class <code>"Dlist"</code> and hence prints tidily.</li>
<li>(Windows.) <code>shell()</code> no longer consults the environment variable <span>SHELL</span>: too many systems have been encountered where it was set incorrectly (usually to a path where software was compiled, not where it was installed). <span>R_SHELL</span>, the preferred way to select a non-default shell, can be used instead.</li>
<li>Some unusual arguments to <code>embedFonts()</code> can now be specified as character vectors, and the defaults have been changed accordingly.</li>
<li>Functions in the <code>Summary</code> group duplicate less. (<a href="https://bugs.r-project.org/bugzilla3/show_bug.cgi?id=15798" target="_blank">PR#15798</a>)</li>
<li>(Unix-alikes.) <code>system(cmd, input = )</code> now uses &lsquo;shell-execution-environment&rsquo; redirection, which will be more natural if <code>cmd</code> is not a single command (but requires a POSIX-compliant shell). (Wish of <a href="https://bugs.r-project.org/bugzilla3/show_bug.cgi?id=15508" target="_blank">PR#15508</a>)</li>
<li><code>read.fwf()</code> and <code>read.DIF()</code> gain a <code>fileEncoding</code> argument, for convenience.</li>
<li>Graphics devices can add attributes to their description in <code>.Device</code> and <code>.Devices</code>. Several of those included with <strong>R</strong> use a <code>"filepath"</code> attribute.</li>
<li><code>pmatch()</code> uses hashing in more cases and so is faster at the expense of using more memory. (<a href="https://bugs.r-project.org/bugzilla3/show_bug.cgi?id=15697" target="_blank">PR#15697</a>)</li>
<li><code>pairs()</code> gains new arguments to select sets of variables to be plotted against each other.</li>
<li><code>file.info(, extra_cols = FALSE)</code> allows a minimal set of columns to be computed on Unix-alikes: on some systems without properly-configured caching this can be significantly faster with large file lists.</li>
<li>New function <code>dir.exists()</code> in package <span>base</span> to test efficiently whether one or more paths exist and are directories.</li>
<li><code>dput()</code> and friends gain new controls <span>hexNumeric</span> and <span>digits17</span> which output double and complex quantities as, respectively, binary fractions (exactly, see <code>sprintf("%a")</code>) and as decimals with up to 17 significant digits.</li>
<li><code>save()</code>, <code>saveRDS()</code> and <code>serialize()</code> now support <code>ascii = NA</code> which writes ASCII files using <code>sprintf("%a")</code> for double/complex quantities. This is read-compatible with <code>ascii = TRUE</code> but avoids binary-&gt;decimal-&gt;binary conversions with potential loss of precision. Unfortunately the Windows C runtime&rsquo;s lack of C99 compliance means that the format cannot be read correctly there in <strong>R</strong> before 3.1.2.</li>
<li>The default for <code>formatC(decimal.mark =)</code> has been changed to be <code>getOption("OutDec")</code>; this makes it more consistent with <code>format()</code> and suitable for use in print methods, e.g. those for classes <code>"density"</code>, <code>"ecdf"</code>, <code>"stepfun"</code> and <code>"summary.lm"</code>.
<p><code>getOption("OutDec")</code> is now consulted by the print method for class <code>"kmeans"</code>, by <code>cut()</code>, <code>dendrogram()</code>, <code>plot.ts()</code> and <code>quantile()</code> when constructing labels and for the report from<code>legend(trace = TRUE)</code>.</p>
<p>(In part, wish of <a href="https://bugs.r-project.org/bugzilla3/show_bug.cgi?id=15819" target="_blank">PR#15819</a>.)</p>
</li>
<li><code>printNum()</code> and hence <code>format()</code> and <code>formatC()</code> give a warning if <code>big.mark</code> and <code>decimal.mark</code> are set to the same value (period and comma are not uncommonly used for each, and this is a check that conventions have not got mixed).</li>
<li><code>merge()</code> can create a result which uses long vectors on 64-bit platforms.</li>
<li><code>dget()</code> gains a new argument <code>keep.source</code> which defaults to <code>FALSE</code> for speed (<code>dput()</code> and <code>dget()</code> are most often used for data objects where this can make <code>dget()</code> many times faster).</li>
<li>Packages may now use a file of common macro definitions in their help files, and may import definitions from other packages.</li>
<li>A number of macros have been added in the new &lsquo;<span>share/Rd</span>&rsquo; directory for use in package overview help pages, and <code>promptPackage()</code> now makes use of them.</li>
<li><code>tools::parse_Rd()</code> gains a new <code>permissive</code> argument which converts unrecognized macros into text. This is used by <code>utils:::format.bibentry</code> to allow LaTeX markup to be ignored.</li>
<li><code>options(OutDec =)</code> can now specify a multi-byte character, e.g., <code>options(OutDec = "u00b7")</code> in a UTF-8 locale.</li>
<li><code>is.recursive(x)</code> is no longer true when <code>x</code> is an external pointer, a weak reference or byte code; the first enables <code>all.equal(x, x)</code> when <code>x .</code></li>
<li><code>ls()</code> (aka <code>objects()</code>) and <code>as.list.environment()</code> gain a new argument <code>sorted</code>.</li>
<li>The <code>"source"</code> attribute (which has not been added to functions by <strong>R</strong> since before <strong>R</strong> version 2.14.0) is no longer treated as special.</li>
<li>Function <code>returnValue()</code> has been added to give <code>on.exit()</code> code access to a function&rsquo;s return value for debugging purposes.</li>
<li><code>crossprod(x, y)</code> allows more matrix coercions when <code>x</code> or <code>y</code> are vectors, now equalling <code>t(x) %*% y</code> in these cases (also reported by Radford Neal). Similarly, <code>tcrossprod(x,y)</code> and <code>%*%</code> work in more cases with vector arguments.</li>
<li>Utility function <code>dynGet()</code> useful for detecting cycles, aka infinite recursions.</li>
<li>The byte-code compiler and interpreter include new instructions that allow many scalar subsetting and assignment and scalar arithmetic operations to be handled more efficiently. This can result in significant performance improvements in scalar numerical code.</li>
<li><code>apply(m, 2, identity)</code> is now the same as the matrix <code>m</code> when it has <em>named</em> row names.</li>
<li>A new function <code>debuggingState()</code> has been added, allowing to temporarily turn off debugging.</li>
<li><code>example()</code> gets a new optional argument <code>run.donttest</code> and <code>tools::Rd2ex()</code> a corresponding <code>commentDonttest</code>, with a default such that <code>example(..)</code> in help examples will run <code>donttest</code> code only if used interactively (a change in behaviour).</li>
<li><code>rbind.data.frame()</code> gains an optional argument <code>make.row.names</code>, for potential speedup.</li>
<li>New function <code>extSoftVersion()</code> to report on the versions of third-party software in use in this session. Currently reports versions of <code>zlib</code>, <code>bzlib</code>, the <code>liblzma</code> from <code>xz</code>, PCRE, ICU, TRE and the <code>iconv</code> implementation.
<p>A similar function <code>grSoftVersion()</code> in package <span>grDevices</span> reports on third-party graphics software.</p>
<p>Function <code>tcltk::tclVersion()</code> reports the Tcl/Tk version.</p>
</li>
<li>Calling <code>callGeneric()</code> without arguments now works with primitive generics to some extent.</li>
<li><code>vapply(x, FUN, FUN.VALUE)</code> is more efficient notably for large <code>length(FUN.VALUE)</code>; as extension of <a href="https://bugs.r-project.org/bugzilla3/show_bug.cgi?id=16061" target="_blank">PR#16061</a>.</li>
<li><code>as.table()</code> now allows tables with one or more dimensions of length 0 (such as <code>as.table(integer())</code>).</li>
<li><code>names(x) now clears the names of call and <code>...</code> objects.</code></li>
<li><code>library()</code> will report a warning when an insufficient dependency version is masking a sufficient one later on the library search path.</li>
<li>A new <code>plot()</code> method for class <code>"raster"</code> has been added.</li>
<li>New <code>check_packages_in_dir_changes()</code> function in package <span>tools</span> for conveniently analyzing how changing sources impacts the check results of their reverse dependencies.</li>
<li>Speed-up from Peter Haverty for <code>ls()</code> and <code>methods:::.requirePackage()</code> speeding up package loading. (<a href="https://bugs.r-project.org/bugzilla3/show_bug.cgi?id=16133" target="_blank">PR#16133</a>)</li>
<li>New <code>get0()</code> function, combining <code>exists()</code> and <code>get()</code> in one call, for efficiency.</li>
<li><code>match.call()</code> gains an <code>envir</code> argument for specifying the environment from which to retrieve the <code>...</code> in the call, if any; this environment was wrong (or at least undesirable) when the<code>definition</code> argument was a function.</li>
<li><code>topenv()</code> has been made <code>.Internal()</code> for speedup, based on Peter Haverty&rsquo;s proposal in <a href="https://bugs.r-project.org/bugzilla3/show_bug.cgi?id=16140" target="_blank">PR#16140</a>.</li>
<li><code>getOption()</code> no longer calls <code>options()</code> in the main case.</li>
<li>Optional use of <code>libcurl</code> (version 7.28.0 from Oct 2012 or later) for Internet access:
<ul>
<li><code>capabilities("libcurl")</code> reports if this is available.</li>
<li><code>libcurlVersion()</code> reports the version in use, and other details of the <code>"libcurl"</code> build including which URL schemes it supports.</li>
<li><code>curlGetHeaders()</code> retrieves the headers for <code>http://</code>, <code>https://</code>, <code>ftp://</code> and <code>ftps://</code> URLs: analysis of these headers can provide insights into the &lsquo;existence&rsquo; of a URL (it might for example be permanently redirected) and is so used in <code>R CMD check --as-cran</code>.</li>
<li><code>download.file()</code> has a new optional method <code>"libcurl"</code> which will handle more URL schemes, follow redirections, and allows simultaneous downloads of multiple URLs.</li>
<li><code>url()</code> has a new method <code>"libcurl"</code> which handles more URL schemes and follows redirections. The default method is controlled by a new option <code>url.method</code>, which applies also to the opening of URLs <em>via</em> <code>file()</code> (which happens implicitly in functions such as <code>read.table</code>.)</li>
<li>When <code>file()</code> or <code>url()</code> is invoked with a <code>https://</code> or <code>ftps://</code> URL which the current method cannot handle, it switches to a suitable method if one is available.</li>
</ul>
</li>
<li>(Windows.) The DLLs &lsquo;<span>internet.dll</span>&rsquo; and &lsquo;<span>internet2.dll</span>&rsquo; have been merged. In this version it is safe to switch (repeatedly) between the internal and Windows internet functions within an <strong>R</strong>session.
<p>The Windows internet functions are still selected by flag <span>&ndash;internet2</span> or <code>setInternet2()</code>. This can be overridden for an <code>url()</code> connection <em>via</em> its new <code>method</code> argument.</p>
<p><code>download.file()</code> has new method <code>"wininet"</code>, selected as the default by <span>&ndash;internet2</span> or <code>setInternet2()</code>.</p>
</li>
<li><code>parent.env&lt;-</code> can no longer modify the parent of a locked namespace or namespace imports environment. Contributed by Karl Millar.</li>
<li>New function <code>isLoadedNamespace()</code> for readability and speed.</li>
<li><code>names(env)</code> now returns all the object names of an <code>environment</code> <code>env</code>, equivalently to <code>ls(env, all.names = TRUE, sorted = FALSE)</code> and also to the names of the corresponding list,<code>names(as.list(env, all.names = TRUE))</code>. Note that although <code>names()</code> returns a character vector, the names have no particular ordering.</li>
<li>The memory manager now grows the heap more aggressively. This reduces the number of garbage collections, in particular while data or code are loaded, at the expense of slightly increasing the memory footprint.</li>
<li>New function <code>trimws()</code> for removing leading/trailing whitespace.</li>
<li><code>cbind()</code> and <code>rbind()</code> now consider S4 inheritance during S3 dispatch and also obey <code>deparse.level</code>.</li>
<li><code>cbind()</code> and <code>rbind()</code> will delegate recursively to <code>methods::cbind2</code> (<code>methods::rbind2</code>) when at least one argument is an S4 object and S3 dispatch fails (due to ambiguity).</li>
<li>(Windows.) <code>download.file(quiet = FALSE)</code> now uses text rather than Windows progress bars in non-interactive use.</li>
<li>New function <code>hsearch_db()</code> in package <span>utils</span> for building and retrieving the help search database used by <code>help.search()</code>, along with functions for inspecting the concepts and keywords in the help search database.</li>
<li>New function <code>.getNamespaceInfo()</code>, a no-check version of <code>getNamespaceInfo()</code> mostly for internal speedups.</li>
<li>The help search system now takes <span>keyword</span> entries in Rd files which are not standard keywords (as given in &lsquo;<span>KEYWORDS</span>&rsquo; in the <strong>R</strong> documentation directory) as concepts. For standard keyword entries the corresponding descriptions are additionally taken as concepts.</li>
<li>New <code>lengths()</code> function for getting the lengths of all elements in a list.</li>
<li>New function <code>toTitleCase()</code> in package <span>tools</span>, tailored to package titles.</li>
<li>The matrix methods of <code>cbind()</code> and <code>rbind()</code> allow matrices as inputs which have <em>2^31</em> or more elements. (For <code>cbind()</code>, wish of <a href="https://bugs.r-project.org/bugzilla3/show_bug.cgi?id=16198" target="_blank">PR#16198</a>.)</li>
<li>The default method of <code>image()</code> has an explicit check for a numeric or logical matrix (which was always required).</li>
<li><code>URLencode()</code> will not by default encode further URLs which appear to be already encoded.</li>
<li><code>BIC(mod)</code> and <code>BIC(mod, mod2)</code> now give non-NA numbers for <code>arima()</code> fitted models, as <code>nobs(mod)</code> now gives the number of &ldquo;used&rdquo; observations for such models. This fixes <a href="https://bugs.r-project.org/bugzilla3/show_bug.cgi?id=16198" target="_blank">PR#16198</a>, quite differently than proposed there.</li>
<li>The <code>print()</code> methods for <code>"htest"</code>, <code>"pairwise.htest"</code> and <code>"power.htest"</code> objects now have a <code>digits</code> argument defaulting to (a function of) <code>getOption("digits")</code>, and influencing all printed numbers coherently. Unavoidably, this changes the display of such test results in some cases.</li>
<li>Code completion for namespaces now recognizes all loaded namespaces, rather than only the ones that are also attached.</li>
<li>The code completion mechanism can now be replaced by a user-specified completer function, for (temporary) situations where the usual code completion is inappropriate.</li>
<li><code>unzip()</code> will now warn if it is able to detect truncation when unpacking a file of 4GB or more (related to <a href="https://bugs.r-project.org/bugzilla3/show_bug.cgi?id=16243" target="_blank">PR#16243</a>).</li>
<li><code>methods()</code> reports S4 in addition to S3 methods; output is simplified when the <code>class</code> argument is used. <code>.S3methods()</code> and <code>methods::.S4methods()</code> report S3 and S4 methods separately.</li>
<li>Higher order functions such as the <code>apply</code> functions and <code>Reduce()</code> now force arguments to the functions they apply in order to eliminate undesirable interactions between lazy evaluation and variable capture in closures. This resolves <a href="https://bugs.r-project.org/bugzilla3/show_bug.cgi?id=16093" target="_blank">PR#16093</a>.</li>
</ul><p>More at http://cran.rstudio.com/</p><p>Reference: http://www.r-bloggers.com/r-3-2-0-is-released-using-the-installr-package-to-upgrade-in-windows-os/</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44591/yamp-yet-another-metagenomic-pipeline</guid>
	<pubDate>Sat, 06 Jul 2024 04:26:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44591/yamp-yet-another-metagenomic-pipeline</link>
	<title><![CDATA[YAMP: Yet Another Metagenomic Pipeline]]></title>
	<description><![CDATA[<p><span>YAMP is constructed on&nbsp;</span><a href="https://www.nextflow.io/docs/latest/index.html">Nextflow</a><span>, a framework based on the dataflow programming model, which allows writing workflows that are highly parallel, easily portable (including on distributed systems), and very flexible and customisable, characteristics which have been inherited by YAMP. New modules can be added easily and the existing ones can be customised -- even though we have already provided default parameters deriving from our own experience.</span></p><p>Address of the bookmark: <a href="https://github.com/alesssia/YAMP" rel="nofollow">https://github.com/alesssia/YAMP</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22239/jrf-bioinformatics-at-national-institute-of-high-security-animal-diseases-icar</guid>
  <pubDate>Tue, 28 Apr 2015 02:21:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF Bioinformatics at National Institute of High Security Animal Diseases (ICAR)]]></title>
  <description><![CDATA[
<p>F.No. 4-59/2013-NIHSAD Dated: 21st April, 2015</p>

<p>SRF/ JRF job vacancies in National Institute of High Security Animal Diseases (ICAR)</p>

<p>Name of Post : JRF</p>

<p>No. of Post : 01</p>

<p>Qualification : M.V.Sc or M.Tech./M.Sc. (preferably with NET qualification) in one of following disciplines. (Biotechnology/Molecular Biology/Genetics/Microbiology/Bioinformatics or equivalent Life Sciences discipline). Desirable: Working Knowledge in the areas of Recombinant DNA Techniques, Cell Culture, Handling Laboratory Animals, Genomics.</p>

<p>Emolument : Rs.16,000/-</p>

<p>Age Limit : Up to 30 years</p>

<p>Name of Post : Project Assistant</p>

<p>No of Post : 01</p>

<p>Qualifications : First class M.Sc. /B.E/B.Tech. in one of the following disciplines Biotechnology/ Bioinformatics/ Microbiology or equivalent Life Sciences discipline). Desirable : Exposure of working in research environment, Good command over written/spoken English and computer applications.</p>

<p>Emolument : Rs.8000/-</p>

<p>Age Limit : Upto 28 years</p>

<p>Name of Post : Project Assistant</p>

<p>No of Post : 01</p>

<p>Qualification : First class M.Sc. /B.V.Sc. and A.H., B.Tech. /B.E. in Life Sciences and related areas. Desirable: Exposure of working in research environment, Good command over written/type written/spoken English and computer applications. </p>

<p>Emoluments : Rs. 8000/-</p>

<p>Age Limit : Up to 28 years<br />How to apply</p>

<p>Desirous candidates may send their applications by e-mail (techcell@hsadl.nic.in ) followed by post in the prescribed proforma latest by 11/05/2015. Walk-in-Interview will be held at NIHSAD, Kokta Road, Anand Nagar, Bhopal-462022.</p>

<p>http://www.nihsad.nic.in/pdf/Advt.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33847/omega2-metagenome-assembly-pipeline</guid>
	<pubDate>Mon, 10 Jul 2017 05:56:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33847/omega2-metagenome-assembly-pipeline</link>
	<title><![CDATA[Omega2: metagenome assembly pipeline]]></title>
	<description><![CDATA[<p><span>Omega found overlaps between reads using a prefix/suffix hash table. The overlap graph of reads was simplified by removing transitive edges and trimming short branches. Unitigs were generated based on minimum cost flow analysis of the overlap graph and then merged to contigs and scaffolds using mate-pair information. In comparison with three de Bruijn graph assemblers (SOAPdenovo, IDBA-UD and MetaVelvet), Omega provided comparable overall performance on a HiSeq 100-bp dataset and superior performance on a MiSeq 300-bp dataset. In comparison with Celera on the MiSeq dataset, Omega provided more continuous assemblies overall using a fraction of the computing time of existing overlap-layout-consensus assemblers. This indicates Omega can more efficiently assemble longer Illumina reads, and at deeper coverage, for metagenomic datasets.</span></p><p>Address of the bookmark: <a href="http://omega.omicsbio.org/" rel="nofollow">http://omega.omicsbio.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22285/project-associate-bioinformatics-iit-mandi</guid>
  <pubDate>Wed, 06 May 2015 06:18:47 -0500</pubDate>
  <link></link>
  <title><![CDATA[Project Associate Bioinformatics @ IIT Mandi]]></title>
  <description><![CDATA[
<p>Eligibility : MSc(Bio-Informatics, Bio-Tech), BSc, BE/B.Tech(Bio-Medical /Bio-Technology Engg, CSE)</p>

<p>Location : Kulu</p>

<p>Job Category : Govt Jobs, Research</p>

<p>Last Date : 20 May 2015</p>

<p>Job Type : Full Time</p>

<p>Hiring Process : Walk - In<br />IIT Mandi - Job Details<br />IIT Mandi</p>

<p>Project Associate Bioinformatics Job vacancies in IIT Mandi on purely temporary</p>

<p>Project: “Exploring the Human Microbiome: A hunt for the candidates for Pre- and Pro-biotics.”</p>

<p>Minimum Qualification and Experience: M.Sc. in Bioinformatics OR B.Tech / BE in Bioinformatics OR M. Sc. in Biotechnology / Life sciences or related areas with Diploma or relevant experience in Bioinformatics OR B.Tech in Biotechnology / Computer Science or MCA or B. Sc. in Life Sciences or related areas with PG diploma in Bioinformatics. Candidates with experience in NGS data handling and analysis will be preferred. Tenure: Initially for one year, extendable based upon performance.</p>

<p>No of Posts: 01</p>

<p>Salary: Rs. 12000- 18000/- per month.</p>

<p>How to apply</p>

<p>Interested candidates can come for a Walk-in-Interview on 20th May 2015 starting at 8:30 AM at the Academic Block, Indian Institute of Technology (IIT), Mandi, Vallabh College Campus, Near Bus Stand, Mandi, HP. The candidates should bring along their curriculum vitae (CV) and copies of educational and experience certificates. In case of any queries please contact: Dr. Tulika Prakash Srivastava (Principal Investigator), Indian Institute of Technology Mandi, Near Bus Stand Mandi - 175 001, Himachal Pradesh.</p>

<p>More at</p>

<p>http://www.iitmandi.ac.in/administration/advrt/Walk-in-interview_Ad.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34525/hic-pro-an-optimized-and-flexible-pipeline-for-hi-c-data-processing</guid>
	<pubDate>Wed, 06 Dec 2017 01:05:21 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34525/hic-pro-an-optimized-and-flexible-pipeline-for-hi-c-data-processing</link>
	<title><![CDATA[HiC-Pro: an optimized and flexible pipeline for Hi-C data processing]]></title>
	<description><![CDATA[<p><span>HiC-Pro was designed to process Hi-C data, from raw fastq files (paired-end Illumina data) to the normalized contact maps. Since version 2.7.0, HiC-Pro supports the main Hi-C protocols, including digestion protocols as well as protocols that do not require restriction enzyme such as DNase Hi-C. In practice, HiC-Pro can be used to process dilution Hi-C, in situ Hi-C, DNase Hi-C, Micro-C, capture-C, capture Hi-C or HiChip data.</span></p>
<p>&nbsp;</p>
<p>http://nservant.github.io/HiC-Pro/</p><p>Address of the bookmark: <a href="http://nservant.github.io/HiC-Pro/" rel="nofollow">http://nservant.github.io/HiC-Pro/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>