Demo Data from EDBT 2026 / reviewers in the wild / expert
Vsevolod J. Makeev
dblp:96/264
· DBLP profile ↗
10ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0001-9405-9748ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 10 · 1 first-author · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
7 papers |
Bioinformatics and computational biology · 100% |
Topics — the 13 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › gene regulation
regulatory genomics |
0.3 | 3 | 2011 | A deeper look into transcription regulatory code by preferred pair distance templates for transcription factor binding sites · Bioinform. 2011 Deep and wide digging for binding motifs in ChIP-Seq data · Bioinform. 2010 Motif discovery and motif finding from genome-mapped DNase footprint data · Bioinform. 2009 |
Bioinformatics and computational biology › sequence analysis
motif discovery |
0.2 | 2 | 2010 | Deep and wide digging for binding motifs in ChIP-Seq data · Bioinform. 2010 Motif discovery and motif finding from genome-mapped DNase footprint data · Bioinform. 2009 |
Bioinformatics and computational biology › gene regulation › transcription factor binding site prediction
transcription factor binding site analysis |
0.1 | 1 | 2011 | A deeper look into transcription regulatory code by preferred pair distance templates for transcription factor binding sites · Bioinform. 2011 |
Bioinformatics and computational biology › sequence analysis › motif discovery
ChIP-Seq motif discovery |
0.1 | 1 | 2010 | Deep and wide digging for binding motifs in ChIP-Seq data · Bioinform. 2010 |
Bioinformatics and computational biology › sequence analysis
genomic sequence analysis |
0.1 | 1 | 2006 | Short fuzzy tandem repeats in genomic sequences, identification, and possible role in regulation of gene expression · Bioinform. 2006 |
Bioinformatics and computational biology › genomics › repetitive DNA analysis
tandem repeat identification |
0.1 | 1 | 2006 | Short fuzzy tandem repeats in genomic sequences, identification, and possible role in regulation of gene expression · Bioinform. 2006 |
Bioinformatics and computational biology › gene regulation › regulatory element discovery
regulatory element prediction |
0.1 | 1 | 2005 | A Gibbs sampler for identification of symmetrically structured, spaced DNA motifs with improved estimation of the signal length · Bioinform. 2005 |
Bioinformatics and computational biology
genomics |
0.0 | 1 | 2001 | Segmentation of long genomic sequences into domains with homogeneous composition with BASIO software · Bioinform. 2001 |
Bioinformatics and computational biology › sequence analysis › sequence annotation
sequence segmentation |
0.0 | 1 | 2001 | Segmentation of long genomic sequences into domains with homogeneous composition with BASIO software · Bioinform. 2001 |
Bioinformatics and computational biology
gene regulation |
0.0 | 1 | 2006 | Short fuzzy tandem repeats in genomic sequences, identification, and possible role in regulation of gene expression · Bioinform. 2006 |
Bioinformatics and computational biology › gene regulation
regulatory sequence analysis |
0.0 | 1 | 2006 | Short fuzzy tandem repeats in genomic sequences, identification, and possible role in regulation of gene expression · Bioinform. 2006 |
Bioinformatics and computational biology
periodicity detection |
0.0 | 1 | 1996 | Search of periodicities in primary structure of biopolymers: a general Fourier approach · Comput. Appl. Biosci. 1996 |
Bioinformatics and computational biology
sequence analysis |
0.0 | 1 | 1996 | Search of periodicities in primary structure of biopolymers: a general Fourier approach · Comput. Appl. Biosci. 1996 |
Methods — techniques the papers use, named apart from their topics
binding motif construction · 0.1greedy optimization · 0.1coverage profile · 0.1bootstrapping · 0.1position weight matrix · 0.1bigfoot heuristic · 0.1SeSiMCMC sampler · 0.1p-value computation · 0.1gibbs sampling · 0.1bayesian estimation · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Enhancing SNV identification in whole-genome sequencing data through the incorporation of known genetic variants into the minimap2 indexabstractMOTIVATION: Alignment of reads to a reference genome sequence is one of the key steps in the analysis of human whole-genome sequencing data obtained through Next-generation sequencing (NGS) technologies. The quality of the subsequent steps of the analysis, such as the results of clinical interpretation of genetic variants or the results of a genome-wide association study, depends on the correct identification of the position of the read as a result of its alignment. The amount of human NGS whole-genome sequencing data is constantly growing. There are a number of human genome sequencing projects worldwide that have resulted in the creation of large-scale databases of genetic variants of sequenced human genomes. Such information about known genetic variants can be used to improve the quality of alignment at the read alignment stage when analysing sequencing data obtained for a new individual, for example, by creating a genomic graph. While existing methods for aligning reads to a linear reference genome have high alignment speed, methods for aligning reads to a genomic graph have greater accuracy in variable regions of the genome. The development of a read alignment method that takes into account known genetic variants in the linear reference sequence index allows combining the advantages of both sets of methods. RESULTS: In this paper, we present the minimap2_index_modifier tool, which enables the construction of a modified index of a reference genome using known single nucleotide variants and insertions/deletions (indels) specific to a given human population. The use of the modified minimap2 index improves variant calling quality without modifying the bioinformatics pipeline and without significant additional computational overhead. Using the PrecisionFDA Truth Challenge V2 benchmark data (for HG002 short-read data aligned to the GRCh38 linear reference (GCA_000001405.15) with parameters k = 27 and w = 14) it was demonstrated that the number of false negative genetic variants decreased by more than 9500, and the number of false positives decreased by more than 7000 when modifying the index with genetic variants from the Human Pangenome Reference Consortium. Egor Guguchkin, Artem Kasianov, Maksim Belenikin, Gaukhar Zobkova, Ekaterina Kosova, Vsevolod J. Makeev, Evgeny Karpulevich |
BMC Bioinform. | 6 |
| 2024 | Correction: Enhancing SNV identification in whole-genome sequencing data through the incorporation of known genetic variants into the minimap2 index
Egor Guguchkin, Artem Kasianov, Maksim Belenikin, Gaukhar Zobkova, Ekaterina Kosova, Vsevolod J. Makeev, Evgeny Karpulevich |
BMC Bioinform. | 6 |
| 2012 | Exploring Massive, Genome Scale Datasets with the GenometriCorr PackageabstractUNLABELLED: We have created a statistically grounded tool for determining the correlation of genomewide data with other datasets or known biological features, intended to guide biological exploration of high-dimensional datasets, rather than providing immediate answers. The software enables several biologically motivated approaches to these data and here we describe the rationale and implementation for each approach. Our models and statistics are implemented in an R package that efficiently calculates the spatial correlation between two sets of genomic intervals (data and/or annotated features), for use as a metric of functional interaction. The software handles any type of pointwise or interval data and instead of running analyses with predefined metrics, it computes the significance and direction of several types of spatial association; this is intended to suggest potentially relevant relationships between the datasets. AVAILABILITY AND IMPLEMENTATION: The package, GenometriCorr, can be freely downloaded at http://genometricorr.sourceforge.net/. Installation guidelines and examples are available from the sourceforge repository. The package is pending submission to Bioconductor. Alexander V. Favorov, Loris Mularoni, Leslie Cope, Yulia A. Medvedeva, Andrey A. Mironov, Vsevolod J. Makeev, Sarah J. Wheelan |
PLoS Comput. Biol. | 6 |
| 2011 | A deeper look into transcription regulatory code by preferred pair distance templates for transcription factor binding sitesabstractMOTIVATION: Modern experimental methods provide substantial information on protein-DNA recognition. Studying arrangements of transcription factor binding sites (TFBSs) of interacting transcription factors (TFs) advances understanding of the transcription regulatory code. RESULTS: We constructed binding motifs for TFs forming a complex with HIF-1α at the erythropoietin 3(')-enhancer. Corresponding TFBSs were predicted in the segments around transcription start sites (TSSs) of all human genes. Using the genome-wide set of regulatory regions, we observed several strongly preferred distances between hypoxia-responsive element (HRE) and binding sites of a particular cofactor protein. The set of preferred distances was called as a preferred pair distance template (PPDT). PPDT dramatically depended on the TF and orientation of its binding sites relative to HRE. PPDT evaluated from the genome-wide set of regulatory sequences was used to detect significant PPDT-consistent binding site pairs in regulatory regions of hypoxia-responsive genes. We believe PPDT can help to reveal the layout of eukaryotic regulatory segments. CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Ivan V. Kulakovskiy, A. A. Belostotsky, Artem S. Kasianov, Natalia G. Esipova, Yulia A. Medvedeva, I. A. Eliseeva, Vsevolod J. Makeev |
Bioinform. | 7 |
| 2010 | Deep and wide digging for binding motifs in ChIP-Seq dataabstractSUMMARY: ChIP-Seq data are a new challenge for motif discovery. Such a data typically consists of thousands of DNA segments with base-specific coverage values. We present a new version of our DNA motif discovery software ChIPMunk adapted for ChIP-Seq data. ChIPMunk is an iterative algorithm that combines greedy optimization with bootstrapping and uses coverage profiles as motif positional preferences. ChIPMunk does not require truncation of long DNA segments and it is practical for processing up to tens of thousands of data sequences. Comparison with traditional (MEME) or ChIP-Seq-oriented (HMS) motif discovery tools shows that ChIPMunk identifies the correct motifs with the same or better quality but works dramatically faster. AVAILABILITY AND IMPLEMENTATION: ChIPMunk is freely available within the ru_genetika Java package: http://line.imb.ac.ru/ChIPMunk. Web-based version is also available. CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Ivan V. Kulakovskiy, Valentina Boeva, Alexander V. Favorov, Vsevolod J. Makeev |
Bioinform. | 4 |
| 2009 | Motif discovery and motif finding from genome-mapped DNase footprint dataabstractMOTIVATION: Footprint data is an important source of information on transcription factor recognition motifs. However, a footprinting fragment can contain no sequences similar to known protein recognition sites. Inspection of genome fragments nearby can help to identify missing site positions. RESULTS: Genome fragments containing footprints were supplied to a pipeline that constructed a position weight matrix (PWM) for different motif lengths and selected the optimal PWM. Fragments were aligned with the SeSiMCMC sampler and a new heuristic algorithm, Bigfoot. Footprints with missing hits were found for approximately 50% of factors. Adding only 2 bp on both sides of a footprinting fragment recovered most hits. We automatically constructed motifs for 41 Drosophila factors. New motifs can recognize footprints with a greater sensitivity at the same false positive rate than existing models. Also we discuss possible overfitting of constructed motifs. AVAILABILITY: Software and the collection of regulatory motifs are freely available at http://line.imb.ac.ru/DMMPMM. Ivan V. Kulakovskiy, Alexander V. Favorov, Vsevolod J. Makeev |
Bioinform. | 3 |
| 2006 | Short fuzzy tandem repeats in genomic sequences, identification, and possible role in regulation of gene expressionabstractMOTIVATION: Genomic sequences are highly redundant and contain many types of repetitive DNA. Fuzzy tandem repeats (FTRs) are of particular interest. They are found in regulatory regions of eukaryotic genes and are reported to interact with transcription factors. However, accurate assessment of FTR occurrences in different genome segments requires specific algorithm for efficient FTR identification and classification. RESULTS: We have obtained formulas for P-values of FTR occurrence and developed an FTR identification algorithm implemented in TandemSWAN software. Using TandemSWAN we compared the structure and the occurrence of FTRs with short period length (up to 24 bp) in coding and non-coding regions including UTRs, heterochromatic, intergenic and enhancer sequences of Drosophila melanogaster and Drosophila pseudoobscura. Tandems with period three and its multiples were found in coding segments, whereas FTRs with periods multiple of six are overrepresented in all non-coding segment. Periods equal to 5-7 and 11-14 were characteristic of the enhancer regions and other non-coding regions close to genes. AVAILABILITY: TandemSWAN web page, stand-alone version and documentation can be found at http://bioinform.genetika.ru/projects/swan/www/ SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Valentina Boeva, Mireille Régnier, Dmitri A. Papatsenko, Vsevolod J. Makeev |
Bioinform. | 4 |
| 2005 | A Gibbs sampler for identification of symmetrically structured, spaced DNA motifs with improved estimation of the signal lengthabstractMOTIVATION: Transcription regulatory protein factors often bind DNA as homo-dimers or hetero-dimers. Thus they recognize structured DNA motifs that are inverted or direct repeats or spaced motif pairs. However, these motifs are often difficult to identify owing to their high divergence. The motif structure included explicitly into the motif recognition algorithm improves recognition efficiency for highly divergent motifs as well as estimation of motif geometric parameters. RESULT: We present a modification of the Gibbs sampling motif extraction algorithm, SeSiMCMC (Sequence Similarities by Markov Chain Monte Carlo), which finds structured motifs of these types, as well as non-structured motifs, in a set of unaligned DNA sequences. It employs improved estimators of motif and spacer lengths. The probability that a sequence does not contain any motif is accounted for in a rigorous Bayesian manner. We have applied the algorithm to a set of upstream regions of genes from two Escherichia coli regulons involved in respiration. We have demonstrated that accounting for a symmetric motif structure allows the algorithm to identify weak motifs more accurately. In the examples studied, ArcA binding sites were demonstrated to have the structure of a direct spaced repeat, whereas NarP binding sites exhibited the palindromic structure. AVAILABILITY: The WWW interface of the program, its FreeBSD (4.0) and Windows 32 console executables are available at http://bioinform.genetika.ru/SeSiMCMC Alexander V. Favorov, Mikhail S. Gelfand, Anna V. Gerasimova, Dmitry A. Ravcheev, Andrey A. Mironov, Vsevolod J. Makeev |
Bioinform. | 6 |
| 2001 | Segmentation of long genomic sequences into domains with homogeneous composition with BASIO softwareabstractUNLABELLED: We present a software system BASIO that allows one to segment a sequence into regions with homogeneous nucleotide composition at a desired length scale. The system can work with arbitrary alphabet and therefore can be applied to various (e.g. protein) sequences. Several sequences of complete genomes of eukaryotes are used to demonstrate the efficiency of the software. AVAILABILITY: The BASIO suite is available for non-commercial users free of charge as a set of executables and accompanying segmentation scenarios from http://www.imb.ac.ru/compbio/basio. To obtain the source code, contact the authors. Vasily Ramensky, Vsevolod J. Makeev, Mikhail A. Roytberg, Vladimir G. Tumanyan |
Bioinform. | 2 |
| 1996 | Search of periodicities in primary structure of biopolymers: a general Fourier approachabstractWe discuss a new convenient way to study periodical patterns in primary structures of biopolymers which appeared recently. For the sequence of a biopolymer the symbolic correlation function is constructed, which is used as a digital sequence thus allowing us to perform a Fourier transform. Another fruitful technical improvement is the closing of the sequence in the ring with further scanning of the ring length, which allows the study of periods of the order of the sequence length. This approach makes it possible to take into account any scores describing similarity between symbols and to compare results obtained using different Fourier-like and correlation matrix techniques. An algorithm to compute Fourier spectrum power allows detection of vague periods in sequences containing strong repeats. A PASCAL program, SYMFOUR, has been written and tested on both sequences with periodical patterns, already reported, and sequences and other sites interesting from a biological point of view. Vsevolod J. Makeev, Vladimir G. Tumanyan |
Comput. Appl. Biosci. | 1 |