http://molbiol-tools.ca/Convert.htm

Address of the bookmark: http://molbiol-tools.ca/Convert.htm

Dr Altan Kara is a Bioinformatics specialist at the faculty of Gene Engineering and Biotechnology Institute at TUBITAK MAM Research Center. His research interest revolves around the cancer informatics and computational aided-drug design. I applaud Dr Altan for clearly setting out both his expectations of people that join his lab/university in addition to listing his responsibilities to his research members at TUBITAK MAM Research Institüte. Hopefully, this interview will prove useful to others in the field, especially to those who are just starting their bioinformatics careers.

You can find out more about Dr Altan by visiting his (well documented) lab page (http://gmbe.mam.tubitak.gov.tr/en) and BOL page http://bioinformaticsonline.com/profile/altan . And now, on to the BOL:“Tryst with a Bioinformatician” interview series ...

• What push you to join Computational Biology/Bioinformatics?

According to me, bioinformatics is the center of modern biological research and if a researcher wants to discover new biological insights by evaluating the globally produced biological data to derivate unified solutions for specific biological problems, learning bioinformatics is the only way to achieve this goal.

• What fascinates you about Computational Biology/Bioinformatics?

It's flexibility. As well known, there are highly diverse and complex biological questions are waiting to be enlightened and it's impossible to bring solutions to this diversity by using similar approaches. Thus, the employed method has to be unique for the targeted biological problem and by using bioinformatics tools this can be easily achieved. 

• What is the one word you would use to describe yourself?

Bioinformatician. :)

• Can you please describe your research work in a nutshell for BOL users.

At my current Institute, I am working in the field of cancer bioinformatics. Briefly, the overall aim of the project which I am working for (AKMARK (Project CODE:5153403)) is, applying a bioinformatics-supported genome, transcriptome, proteome, and metabolome analysis to reveal the molecular profile of the disease through an integrated approach, and to develop an early diagnosis and scanning kit based on this profile. Alterations in the gene, transcript, protein, and metabolite profiles between normal tissue, normal tissue adjoined to the tumor (reactive stroma), tumor tissue, lymph node metastasis, and blood samples taken from the same patient and the reflection of these changes in some other selected body fluids will be revealed within the scope of the project. The molecular structures involved in the development and progression of NSCLC will be determined and relations with the clinical, tumor-node-metastasis (TNM) staging and histology will be made. The development of a diagnostic kit for immediate clinical purposes and an electrochemical biosensor for quick on-site applications are targeted through the development of a number of antibody and aptamer formed against the most specific biomarker selected from the panel.

• Is there anything else we should know about you and your research?

Besides AKMARK, I am also in preparation of having a side project that aims for the development of a computational method to design inhibitors for prokaryotic two-component systems. In this project, I will be in collaboration with Prof. Maria Kontoyianni, SIUE: Southern Illinois University Edwardsville, School of Pharmacy.

• What was your greatest scientific disappointment in life till now?

So far I do not experience any memorable scientific disappointment in my life. :)

• What major research challenges and problems did you face yet? How did you handle them?

The major challenge which I faced so far in my scientific career was predicting the interaction between the prokaryotic two-component proteins. To be able to accurately predict the interactions between these proteins, I create a meta-predictor by using a support vector machine. By using this technique I integrated six different protein-protein interaction methods in a way to cover disadvantage of one method with the advantage of another one. The meta-predictor which I developed during this work is accessible via http://metapred2cs.ibers.aber.ac.uk/ and for more detailed information about the system the articles with the PMID IDs; PMID: 27378293 and PMID: 26384938 can be read.

• What's your all-time favourite bioinformatics package, and why?

For me, the best bioinformatics package is R/Bioconductor. The reason why I like this package is, it provides lots of useful tools for comprehensive analysis and comparison of high-throughput experimental data in an integrated manner and besides lots of the packages it provides, it is open source and also open for development. As a result, it provides strong and flexible ways to do science.

• In bioinformatics, do you see yourself in which of the following roles-scientist, analyst, developer, engineer or pure academician?

Scientist / Developer.

• What will you like to accomplish in next five years / ten years?

For my current research, I would like to design a pipeline to automatically integrate and analyse omics data for cancer research which will be specifically aiming for biomarker and novel drug target discovery. In addition to this, I also like to develop another pipeline for prokaryotic TCS protein structure prediction and inhibitor design.

• When you will be retired, what would you tell next generation bioinformaticians?

Bioinformatics is not all about scripting and researchers who study in this field should never expect a tool to do their analyses for them. Besides computational skills, a bioinformatician must have a strong biological background in his/her research area which will allow them to understand if anything went wrong during their run by only looking at the results instead of just blindly trusting the output of the bioinformatics tools.

• What you always miss in bioinformatics when you will no longer working in this field?

Bioinformatics is open to doing multi-discipliner research with scientists all around the world. As a result, while I studying in this field I can interactively learn a lot from wide range research community. I think this is the one thing which I will miss the most.

• If there will be bioinformatics company owned by you in future, What are your company focus and aim?

With the increasing amount of data in databases, there is already a massive need for effective methods to eliminate the manipulated data and reach to clean/useful information. As days pass, the requirement of data mining will be the first step of any research project. For this reason, the major goal of my bioinformatics company will be developing effective tools to eliminate manipulated datasets and information that exist in the literature and provide trustworthy clean information/datasets for researchers.

• How much bioinformatics change in 2050, according to your wild imagination?

Bioinformatics is a field that constantly and dynamically changes. As the bioinformatics progress, new tools and methods become available and they provide a better application of existing methods or totally new methods that offer an alternative solution to various biological problems. A long with these updates, developers also provide easy to use GUIs for most of the tools. Considering this, if the field carries on developing like this, every single researcher with a strong biological background can be able to perform bioinformatics analyses by him/herself without needing a professional help. As a result, almost all of the bioinformaticians will be responsible just for development of new methods/tools.

• What would one piece of advice you give someone who's trying to reinvent themselves and enter into bioinformatics sector?

Bioinformatics is a wide field with a lot of career options. Thus, if a researcher likes to step into this field first he/she should be clear about the branch of the bioinformatics they like to study in. Following to this decision they should first learn at least one programing language and investigate the ways of how other researcher employed that language in their researches and WHY? A researcher, in this field, should never create and use copy paste scripts but always must understand WHY the other researcher worked in that way. Knowing the answer of this question is the only way to learn bioinformatics. Besides, a researcher in the field of bioinformatics (from any branch) must always be good about the environmental control. In other words, one should always easily control input output directories, modify files or directories, annotate and modify employed scripts during the research and should not allow any confusion during the different stages of the research. Finally, they should not blindly trust the output of a tool/software but do a benchmarking test for each of the tools which they decided to utilise in their research. In addition to this, even if the tools pass the benchmarking, researchers should have a good biological background in their field to tell if anything when wrong during the process by only looking the output(s) of the employed pipelines/packages/tools.  

Please enter a list of Gene Ontology IDs below, each on its own line. The GO IDs may be followed by p-values or another quantity which describes the GO term in a way meaningful to you. 

Address of the bookmark: http://revigo.irb.hr/

https://www.biorxiv.org/content/10.1101/2020.02.29.970970v1

Address of the bookmark: https://github.com/wanyuac/GeneMates

https://www.readcube.com/articles/10.3390%2Fv9040072

Address of the bookmark: https://pubmed.ncbi.nlm.nih.gov/28387730/

Following are the list of Ancestral /sequence/ reconstruction (ASR) tools: 

inferCars

Reconstructs contiguous regions of an ancestral genome. Given information about adjacencies between conserved segments in each modern species, our goal is to infer segment order in the ancestral genome. To get a clean and precise statement of the problem, we formalize it using graph theory. We develop an algorithm that identifies a most parsimonious scenario for the history of each individual adjacency, although the whole-genome prediction is not guaranteed to optimize traditional measures like the number of breakpoints. We introduce weights to the graph edges to model the reliability of each adjacency.

ANGES:reconstructing ANcestral GEnomeS maps

A suite of Python programs that allows reconstructing ancestral genome maps from the comparison of the organization of extant-related genomes. ANGES can reconstruct ancestral genome maps for multichromosomal linear genomes and unichromosomal circular genomes. It implements methods inspired from techniques developed to compute physical maps of extant genomes.

Cocos

Constructs phylogenies of multi-domain proteins. With a given species tree and domain phylogenies, the procedure infers the composition of ancestral multi-domain proteins. Cocos implements and extend a suggested algorithmic approach by Behzadi and Vingron in an easy-to-use program. Such method could be applied to reconstruction of partial homologous units such as bacterial operons or protein complexes.

MySSP

Constructs an initial DNA sequence at the root of the tree and simulates evolution across the tree using a variety of common models of DNA evolution. MySSP is a program for the simulation of DNA sequence evolution across a phylogenetic tree. It is designed for large-scale studies, including simulation of multiple replicates and outputs sequences into NEXUS, MEGA, or FASTA formats. MySSP has a fairly simple graphical user interface (GUI) for basic use, but also has a specialized batch script interpreter to allow for more complicated or large-scale simulations.

PARANA: Parsimonious Ancestral Reconstruction And Network Analysis

Performs parsimony based inference of ancestral biological networks. Given multiple extant networks and phylogenetic information relating extant nodes, PARANA finds a parsimonious set of ancestral interaction events (edge gains and losses) which explain the extant networks. The framework adopted by PARANA is able to represent network evolution under models that support gene duplication and loss and independent interaction gain and loss. The method works on both directed and undirected networks and can incorporate asymmetric interaction gain and loss costs. In contrast to previous approaches, PARANA does not require knowing the relative ordering of unrelated duplication events and thus, works on phylogenetic trees even where branch lengths are not provided.

GapAdj: Gapped Adjacencies

A synteny-based method that is flexible enough to handle a model of evolution involving whole genome duplication events, in addition to rearrangements, gene insertions, and losses. Ancestral relationships between markers are defined in term of Gapped Adjacencies, i.e. pairs of markers separated by up to a given number of markers. It improves on a previous restricted to direct adjacencies, which revealed a high accuracy for adjacency prediction, but with the drawback of being overly conservative, i.e. of generating a large number of contiguous ancestral regions (CARs).

ANCESTOR

A web server allowing one to easily and quickly perform the last three steps of the ancestral genome reconstruction procedure. Ancestors implements several alignment algorithms, an indel maximum likelihood solver and a context-dependent maximum likelihood substitution inference algorithm. The results presented by the server include the posterior probabilities for the last two steps of the ancestral genome reconstruction and the expected error rate of each ancestral base prediction.

ProCARs

Reconstructs ancestral gene orders as contiguous ancestral regions (CARs) with a progressive homology-based method. ProCARs runs from a phylogeny tree (without branch lengths needed) with a marked ancestor and a block file. This homology-based method is based on iteratively detecting and assembling ancestral adjacencies, while allowing some micro-rearrangements of synteny blocks at the extremities of the progressively assembled CARs. The method starts with a set of blocks as the initial set of CARs, and detects iteratively the potential ancestral adjacencies between extremities of CARs, while building up the CARs progressively by adding, at each step, new non-conflicting adjacencies that induce the less homoplasy phenomenon. The species tree is used, in some additional internal steps, to compute a score for the remaining conflicting adjacencies, and to detect other reliable adjacencies, in order to reach completely assembled ancestral genomes.

FastML

A user-friendly tool for the reconstruction of ancestral sequences. FastML implements various novel features that differentiate it from existing tools: (i) FastML uses an indel-coding method, in which each gap, possibly spanning multiples sites, is coded as binary data. FastML then reconstructs ancestral indel states assuming a continuous time Markov process. FastML provides the most likely ancestral sequences, integrating both indels and characters; (ii) FastML accounts for uncertainty in ancestral states: it provides not only the posterior probabilities for each character and indel at each sequence position, but also a sample of ancestral sequences from this posterior distribution, and a list of the k-most likely ancestral sequences; (iii) FastML implements a large array of evolutionary models, which makes it generic and applicable for nucleotide, protein and codon sequences; and (iv) a graphical representation of the results is provided, including, for example, a graphical logo of the inferred ancestral sequences.

maxAlike

Reconstructs a genomic sequence for a specific taxon based on sequence homologs in other species. The input is a multiple sequence alignment and a phylogenetic tree that also contains the target species. For this target species, the algorithm computes nucleotide probabilities at each sequence position. Consensus sequences are then reconstructed based on a certain confidence level.

MLGO: Maximum Likelihood for Gene Order Analysis

A web tool for the reconstruction of phylogeny and/or ancestral genomes from gene-order data. MLGO was designed for analysis of large-scale genomic changes including not only rearrangements but also gene insertions, deletions and duplications. MLGO can be used to infer a phylogeny from genome rearrangement and gene order data, and can also obtain an estimation of ancestral genomes, given an input tree. MLGO takes the advantage of binary encoding on gene-order data, supports a fairly general model of genomic evolution (rearrangements plus duplications, insertions, and losses of genomic regions), and successfully accommodates itself into the framework of maximized likelihood.

Image Reference : Wiki

Address of the bookmark: https://sourceforge.net/projects/glean-gene/

It efficiently constructs gene networks from expression data. It allows the user to use ten different network construction methods (such as partial correlation-, likelihood-, Bayesian- and mutual information-based methods) and integrates the resulting networks from multiple methods. Hub gene information, if available, can be incorporated to enhance performance.

GeNeCK is an efficient and easy-to-use web application for gene regulatory network construction. It can be accessed at http://lce.biohpc.swmed.edu/geneck

Address of the bookmark: http://lce.biohpc.swmed.edu/geneck/

1) A cell line expressing or lacking single TF,

2) Breast tumors divided along PAM50 designations

3) Whole brain samples from WT mice or mice lacking a single TF in a particular neuronal subtype

4) Single cell RNAseq analysis of neurons divided by Immediate Early Gene expression levels.

In summary, MAGIC is a standalone application that produces meaningful predictions of TFs and cofactors in transcriptomic experiments.

More at https://uwmadison.app.box.com/s/8j90e5h2rjrsz3bacaxnq8kor2o64vyg

Address of the bookmark: https://github.com/asroopra/MAGIC

Some of GeneProf's highlights include:

• Easy-to-use web-based interface:Access your data at any time from any computer with a working internet connection -- no need to install software! (cp. Section 'System Requirements').
• Analysis wizards make your life easy:Step-by-step workflows make it easy to analyse high-throughput data within a minimum of hands-on time. (cp. SubConcept 'Analysis Wizards').
• Versatile modules:Advanced users and data analysis experts benefit from GeneProf's broad range of analysis modules, which can be combined freely into sophisticated workflows (cp. Concept 'Workflows').
• Integrated Analysis:Analysis of ChIP-seq and RNA-seq data in one place, plus support for the integration of other external data (e.g. from microarrays).
• Comprehensive Resource:GeneProf provides a comprehensive resource of fully analyzed next-generation sequencing data. Experimental results can be easily accessed and compared and the analysis procedures employed to produce the data are fully transparent (cp. Tutorial 'Examining Public Next-Gen Data..').
• Extensibility:Algorithm developers and computer programmers can develop their own modules and extend GeneProf. Existing software can be easily wrapped in the workflow framework (cp. Section 'Module Development: Adding new..') and data from GeneProf may be used externally (cp. Section 'Web API: Retrieving Data from ..').

GeneProf is academic software developed at the Centre for Regenerative Medicine / Institute for Stem Cell Research, University of Edinburgh and has benefited from funding by the Medical Research Council and the EU Framework 7 Project "EuroSyStem".

Address of the bookmark: https://www.geneprof.org/GeneProf/index.jsp