IIHR Vacancy Details:
Total No. of Posts: 14
Name of the Post:
1. Senior Research Fellow: 12 Posts
2. Project Assistant: 01 Post
3. Research Associate: 01 Post

Age Limit: Candidates age limit is 40 years for men & 45 years for women for RA post, 35 years for men & 40 years for women for SRF post, 30 years for men & 35 years for women for JRF post and 21 to 40 years for Other as on closing date of receipt of applications. Age relaxation is applicable as per rules.

Educational Qualification: Candidates should possess M.Sc (Ag) Plant Pathology or Microbiology or Biotechnology or Biochemistry or M.Tech (Ag) or Bioinformatics for SRF Posts, 10th class with experience in workshop (welding fitting) for Project Asst Post and M.Sc (Ag) Plant Pathology or M.Sc (Ag) Biotechnology or Ph.D in Plant Pathology or Agricultural Biotechnology for RA Post.

Selection Process: Candidates will be selected based on their performance in interview.

How to Apply: Eligible candidates may send their application in the prescribed format along with attested copies of relevant certificates and should mention name of PI/ Co-PI, Item No. of the Post & name of the post clearly on the application as well as on the cover to the Concerned PI/ Co-PI, Indian Institute of Horticultural Research, Hessaraghatta Lake Post, Bengaluru-560089 on or before 15-05-2015 and attend the interview along with originals, two passport size photographs on 26 & 27-05-2015 from 10:00 AM Onwards.

Important Dates:
Last Date for Receipt of Applications: 15-05-2015.
Date & Time of Interview: 26 & 27-05-2015 from 10:00 AM Onwards.
Venue: IIHR Campus.

More at http://www.iihr.ernet.in/content/srf-jrf-application-format

However, pangenome graphs can be highly complex, making them difficult to visualize and interpret. A recent study published in BMC Bioinformatics introduces PG2 (PanGenoGrapher), an open-source, web-based tool designed to address this challenge. The source code and user guide are openly available on GitHub at https://github.com/iVis-at-Bilkent/pangenographer. A publicly accessible sample deployment is hosted at http://pg2.cs.bilkent.edu.tr. In addition, a demonstration video illustrating the primary use cases of PG2 is available at https://www.youtube.com/watch?v=yCd7-aGY6CQ.

PG2 combines advanced graph-layout algorithms with an interactive visualization platform. It allows researchers to explore genomic paths, identify variations, and examine relationships between different parts of a pangenome graph more easily.

This is important because visualization can play a major role in bioinformatics. When complex genomic information is presented clearly, researchers can more easily identify patterns, understand genetic variation, and generate new biological insights.

The development of PG2 represents a step toward making pangenome analysis more accessible and intuitive. As genomic datasets continue to grow and graph-based representations become more common, tools like PG2 can help researchers navigate this increasing complexity.

Ultimately, PG2 demonstrates how combining genomics, graph algorithms, and interactive visualization can make sophisticated biological data easier to understand and analyze.

Reference: Solun, G. K., Dogrusoz, U., Bingöl, Z., & Alkan, C. (2026). PG2: algorithms and a web-based tool for effective layout and visual analysis of pangenome graphs. BMC Bioinformatics. DOI: 10.1186/s12859-026-06555-4.

More at http://www.binc.co.in/College/Index_New.aspx

BINC notification http://www.binc.co.in/PdfDocuments/Notification.pdf

Few dates to remember:

Starting of online submission of application: March 9, 2015
Last date for submission of application: April 30,2015
Examination consists of two parts:
Part I (Paper I) : June 7, 2015 (10 AM-12 PM)
Part II ( Paper II & III) :June 28, 2015 (9 AM-12 PM & 2 PM-4 PM)

Scientists face a big challenge with the human genome. They can read its letters, but understanding their roles is much harder. Only about 2 percent of the genome codes for proteins. The rest acts like a huge control panel, deciding when and where genes turn on. With about 9 billion possible single-letter changes, testing them all in a lab just isn’t possible.

So, Google DeepMind asked a new question: what if we could predict what those changes might do?

This question led to the AlphaGenome Atlas (https://deepmind.google.com/science/alphagenome/atlas?), a detailed map of nearly every possible single-letter change in the human genome. Instead of checking each change one by one, researchers can use the Atlas to spot the ones most likely to matter. The AlphaGenome Variant Impact (AVI) score works like a trail marker, pointing scientists toward the changes worth a closer look.

This is where the Atlas gets especially useful. Much of the genome lies outside the protein-coding regions, where DNA acts as a switch or controller for genes. AlphaGenome lets researchers explore these areas and see how small changes could affect gene activity.

An atlas isn't the destination; it's a guide.

The AlphaGenome Atlas doesn’t replace experiments or solve every mystery. Instead, it helps scientists decide where to begin. From billions of possibilities, it turns the vast genetic landscape into something researchers can start to explore.

There are nine billion possibilities, a vast map, and maybe among them therWith nine billion possibilities and a huge map to explore, there may be clues hidden here to some of medicine’s toughest mysteries.

More at https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/alphagenome-atlas-a-predictive-map-of-every-possible-dna-letter-change-in-the-human-genome/alphagenome-atlas.pdf

Name of the College: Karpagam University, Coimbatore

Date of official publication: 15th April 2015

The newspaper wherein this job advertised: The Hindu Newspaper

Name of the posts: Senior Professors, Professors, Associate Professors and Assistant Professors

Departments:
Bioinformatics
Biotechnology
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

Job Location: Coimbatore, TN

Salary: As per college norms

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

Last date: As soon as possible from 15th April 2015

Reference: The Hindu Newspaper dated 15-04-2015, Coimbatore edition on 14th page

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.

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.

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.

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.

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.

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.

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.

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.

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.

Occasionally, the most significant variant within a genome is the one that is almost universally overlooked.

Read more at https://link.springer.com/article/10.1186/s13059-026-04280-y

Upgrading to R 3.2.0 on Windows

If you are using Windows you can easily upgrade to the latest version of R using the installr package. Simply run the following code:

# installing/loading the latest installr package:
install.packages("installr"); library(installr) #load / install+load installr
 
updateR() # updating R.

Running “updateR()” will detect if there is a new R version available, and if so it will download+install it (etc.).

If you are an R blogger yourself you are invited to add your own R content feed to this site (Non-English R bloggers should add themselves- here)

NEW FEATURES

• anyNA() gains a recursive argument.
• When x is missing and names is not false (including the default value), Sys.getenv(x, names) returns an object of class "Dlist" and hence prints tidily.
• (Windows.) shell() no longer consults the environment variable SHELL: too many systems have been encountered where it was set incorrectly (usually to a path where software was compiled, not where it was installed). R_SHELL, the preferred way to select a non-default shell, can be used instead.
• Some unusual arguments to embedFonts() can now be specified as character vectors, and the defaults have been changed accordingly.
• Functions in the Summary group duplicate less. (PR#15798)
• (Unix-alikes.) system(cmd, input = ) now uses ‘shell-execution-environment’ redirection, which will be more natural if cmd is not a single command (but requires a POSIX-compliant shell). (Wish of PR#15508)
• read.fwf() and read.DIF() gain a fileEncoding argument, for convenience.
• Graphics devices can add attributes to their description in .Device and .Devices. Several of those included with R use a "filepath" attribute.
• pmatch() uses hashing in more cases and so is faster at the expense of using more memory. (PR#15697)
• pairs() gains new arguments to select sets of variables to be plotted against each other.
• file.info(, extra_cols = FALSE) 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.
• New function dir.exists() in package base to test efficiently whether one or more paths exist and are directories.
• dput() and friends gain new controls hexNumeric and digits17 which output double and complex quantities as, respectively, binary fractions (exactly, see sprintf("%a")) and as decimals with up to 17 significant digits.
• save(), saveRDS() and serialize() now support ascii = NA which writes ASCII files using sprintf("%a") for double/complex quantities. This is read-compatible with ascii = TRUE but avoids binary->decimal->binary conversions with potential loss of precision. Unfortunately the Windows C runtime’s lack of C99 compliance means that the format cannot be read correctly there in R before 3.1.2.
• The default for formatC(decimal.mark =) has been changed to be getOption("OutDec"); this makes it more consistent with format() and suitable for use in print methods, e.g. those for classes "density", "ecdf", "stepfun" and "summary.lm".

  getOption("OutDec") is now consulted by the print method for class "kmeans", by cut(), dendrogram(), plot.ts() and quantile() when constructing labels and for the report fromlegend(trace = TRUE).

  (In part, wish of PR#15819.)

• printNum() and hence format() and formatC() give a warning if big.mark and decimal.mark 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).
• merge() can create a result which uses long vectors on 64-bit platforms.
• dget() gains a new argument keep.source which defaults to FALSE for speed (dput() and dget() are most often used for data objects where this can make dget() many times faster).
• Packages may now use a file of common macro definitions in their help files, and may import definitions from other packages.
• A number of macros have been added in the new ‘share/Rd’ directory for use in package overview help pages, and promptPackage() now makes use of them.
• tools::parse_Rd() gains a new permissive argument which converts unrecognized macros into text. This is used by utils:::format.bibentry to allow LaTeX markup to be ignored.
• options(OutDec =) can now specify a multi-byte character, e.g., options(OutDec = "u00b7") in a UTF-8 locale.
• is.recursive(x) is no longer true when x is an external pointer, a weak reference or byte code; the first enables all.equal(x, x) when x .
• ls() (aka objects()) and as.list.environment() gain a new argument sorted.
• The "source" attribute (which has not been added to functions by R since before R version 2.14.0) is no longer treated as special.
• Function returnValue() has been added to give on.exit() code access to a function’s return value for debugging purposes.
• crossprod(x, y) allows more matrix coercions when x or y are vectors, now equalling t(x) %*% y in these cases (also reported by Radford Neal). Similarly, tcrossprod(x,y) and %*% work in more cases with vector arguments.
• Utility function dynGet() useful for detecting cycles, aka infinite recursions.
• 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.
• apply(m, 2, identity) is now the same as the matrix m when it has named row names.
• A new function debuggingState() has been added, allowing to temporarily turn off debugging.
• example() gets a new optional argument run.donttest and tools::Rd2ex() a corresponding commentDonttest, with a default such that example(..) in help examples will run donttest code only if used interactively (a change in behaviour).
• rbind.data.frame() gains an optional argument make.row.names, for potential speedup.
• New function extSoftVersion() to report on the versions of third-party software in use in this session. Currently reports versions of zlib, bzlib, the liblzma from xz, PCRE, ICU, TRE and the iconv implementation.

  A similar function grSoftVersion() in package grDevices reports on third-party graphics software.

  Function tcltk::tclVersion() reports the Tcl/Tk version.

• Calling callGeneric() without arguments now works with primitive generics to some extent.
• vapply(x, FUN, FUN.VALUE) is more efficient notably for large length(FUN.VALUE); as extension of PR#16061.
• as.table() now allows tables with one or more dimensions of length 0 (such as as.table(integer())).
• names(x) now clears the names of call and ... objects.
• library() will report a warning when an insufficient dependency version is masking a sufficient one later on the library search path.
• A new plot() method for class "raster" has been added.
• New check_packages_in_dir_changes() function in package tools for conveniently analyzing how changing sources impacts the check results of their reverse dependencies.
• Speed-up from Peter Haverty for ls() and methods:::.requirePackage() speeding up package loading. (PR#16133)
• New get0() function, combining exists() and get() in one call, for efficiency.
• match.call() gains an envir argument for specifying the environment from which to retrieve the ... in the call, if any; this environment was wrong (or at least undesirable) when thedefinition argument was a function.
• topenv() has been made .Internal() for speedup, based on Peter Haverty’s proposal in PR#16140.
• getOption() no longer calls options() in the main case.
• Optional use of libcurl (version 7.28.0 from Oct 2012 or later) for Internet access:
  • capabilities("libcurl") reports if this is available.
  • libcurlVersion() reports the version in use, and other details of the "libcurl" build including which URL schemes it supports.
  • curlGetHeaders() retrieves the headers for http://, https://, ftp:// and ftps:// URLs: analysis of these headers can provide insights into the ‘existence’ of a URL (it might for example be permanently redirected) and is so used in R CMD check --as-cran.
  • download.file() has a new optional method "libcurl" which will handle more URL schemes, follow redirections, and allows simultaneous downloads of multiple URLs.
  • url() has a new method "libcurl" which handles more URL schemes and follows redirections. The default method is controlled by a new option url.method, which applies also to the opening of URLs via file() (which happens implicitly in functions such as read.table.)
  • When file() or url() is invoked with a https:// or ftps:// URL which the current method cannot handle, it switches to a suitable method if one is available.
• (Windows.) The DLLs ‘internet.dll’ and ‘internet2.dll’ have been merged. In this version it is safe to switch (repeatedly) between the internal and Windows internet functions within an Rsession.

  The Windows internet functions are still selected by flag –internet2 or setInternet2(). This can be overridden for an url() connection via its new method argument.

  download.file() has new method "wininet", selected as the default by –internet2 or setInternet2().

• parent.env<- can no longer modify the parent of a locked namespace or namespace imports environment. Contributed by Karl Millar.
• New function isLoadedNamespace() for readability and speed.
• names(env) now returns all the object names of an environment env, equivalently to ls(env, all.names = TRUE, sorted = FALSE) and also to the names of the corresponding list,names(as.list(env, all.names = TRUE)). Note that although names() returns a character vector, the names have no particular ordering.
• 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.
• New function trimws() for removing leading/trailing whitespace.
• cbind() and rbind() now consider S4 inheritance during S3 dispatch and also obey deparse.level.
• cbind() and rbind() will delegate recursively to methods::cbind2 (methods::rbind2) when at least one argument is an S4 object and S3 dispatch fails (due to ambiguity).
• (Windows.) download.file(quiet = FALSE) now uses text rather than Windows progress bars in non-interactive use.
• New function hsearch_db() in package utils for building and retrieving the help search database used by help.search(), along with functions for inspecting the concepts and keywords in the help search database.
• New function .getNamespaceInfo(), a no-check version of getNamespaceInfo() mostly for internal speedups.
• The help search system now takes keyword entries in Rd files which are not standard keywords (as given in ‘KEYWORDS’ in the R documentation directory) as concepts. For standard keyword entries the corresponding descriptions are additionally taken as concepts.
• New lengths() function for getting the lengths of all elements in a list.
• New function toTitleCase() in package tools, tailored to package titles.
• The matrix methods of cbind() and rbind() allow matrices as inputs which have 2^31 or more elements. (For cbind(), wish of PR#16198.)
• The default method of image() has an explicit check for a numeric or logical matrix (which was always required).
• URLencode() will not by default encode further URLs which appear to be already encoded.
• BIC(mod) and BIC(mod, mod2) now give non-NA numbers for arima() fitted models, as nobs(mod) now gives the number of “used” observations for such models. This fixes PR#16198, quite differently than proposed there.
• The print() methods for "htest", "pairwise.htest" and "power.htest" objects now have a digits argument defaulting to (a function of) getOption("digits"), and influencing all printed numbers coherently. Unavoidably, this changes the display of such test results in some cases.
• Code completion for namespaces now recognizes all loaded namespaces, rather than only the ones that are also attached.
• The code completion mechanism can now be replaced by a user-specified completer function, for (temporary) situations where the usual code completion is inappropriate.
• unzip() will now warn if it is able to detect truncation when unpacking a file of 4GB or more (related to PR#16243).
• methods() reports S4 in addition to S3 methods; output is simplified when the class argument is used. .S3methods() and methods::.S4methods() report S3 and S4 methods separately.
• Higher order functions such as the apply functions and Reduce() now force arguments to the functions they apply in order to eliminate undesirable interactions between lazy evaluation and variable capture in closures. This resolves PR#16093.

More at http://cran.rstudio.com/

Reference: http://www.r-bloggers.com/r-3-2-0-is-released-using-the-installr-package-to-upgrade-in-windows-os/

Address of the bookmark: https://github.com/alesssia/YAMP