default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatej Lexa
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[e1]Brona Brejová, Lucie Ciencialová, Martin Holena, Róbert Jajcay, Tatiana Jajcayová, Matej Lexa, Frantisek Mráz, Dana Pardubská, Martin Plátek:
Proceedings of the 23rd Conference Information Technologies - Applications and Theory (ITAT 2023), Tatranské Matliare, Slovakia, September 22-26, 2023. CEUR Workshop Proceedings 3498, CEUR-WS.org 2023 [contents]- 2022
- [j11]Matej Lexa
, Monika Cechova, Son Hoang Nguyen, Pavel Jedlicka, Viktor Tokan, Zdenek Kubat, Roman Hobza, Eduard Kejnovský:
HiC-TE: a computational pipeline for Hi-C data analysis to study the role of repeat family interactions in the genome 3D organization. Bioinform. 38(16): 4030-4032 (2022) - 2021
- [j10]Pratik Goswami, Martin Bartas, Matej Lexa, Natália Bohálová, Adriana Volná, Jirí Cerven, Veronika Cervenová, Petr Pecinka, Vladimír Spunda, Miroslav Fojta, Václav Brázda:
SARS-CoV-2 hot-spot mutations are significantly enriched within inverted repeats and CpG island loci. Briefings Bioinform. 22(2): 1338-1345 (2021) - 2020
- [j9]Dominika Labudová, Jirí Hon, Matej Lexa:
pqsfinder web: G-quadruplex prediction using optimized pqsfinder algorithm. Bioinform. 36(8): 2584-2586 (2020) - [j8]Matej Lexa, Pavel Jedlicka, Ivan Vanat, Michal Cervenanský, Eduard Kejnovský:
TE-greedy-nester: structure-based detection of LTR retrotransposons and their nesting. Bioinform. 36(20): 4991-4999 (2020)
2010 – 2019
- 2018
- [c14]Matej Lexa, Radovan Lapar, Pavel Jedlicka, Ivan Vanat, Michal Cervenanský, Eduard Kejnovský:
TE-nester: a recursive software tool for structure-based discovery of nested transposable elements. BIBM 2018: 2776-2778 - 2017
- [j7]Jirí Hon, Tomás Martínek, Jaroslav Zendulka, Matej Lexa:
pqsfinder: an exhaustive and imperfection-tolerant search tool for potential quadruplex-forming sequences in R. Bioinform. 33(21): 3373-3379 (2017) - 2016
- [j6]Adam Krejci, Ted R. Hupp, Matej Lexa, Borivoj Vojtesek, Petr Müller:
Hammock: a hidden Markov model-based peptide clustering algorithm to identify protein-interaction consensus motifs in large datasets. Bioinform. 32(1): 9-16 (2016) - [c13]Matej Lexa, Radovan Lapar:
Semi-automatic mining of correlated data from a complex database: Correlation network visualization. ICCABS 2016: 1-2 - 2015
- [c12]Stanislav Stefanic, Matej Lexa:
A Flexible Denormalization Technique for Data Analysis above a Deeply-Structured Relational Database: Biomedical Applications. IWBBIO (1) 2015: 120-133 - 2014
- [c11]Matej Lexa, Tomás Martínek, Marie Brázdová:
Uneven Distribution of Potential Triplex Sequences in the Human Genome - In Silico Study using the R/Bioconductor Package Triplex. BIOINFORMATICS 2014: 80-88 - [c10]Matej Lexa, Stanislav Stefanic:
The Possibilities of Filtering Pairs of SNPs in GWAS Studies - Exploratory Study on Public Protein-interaction and Pathway Data. BIOINFORMATICS 2014: 259-264 - 2013
- [j5]Jirí Hon, Tomás Martínek, Kamil Rajdl, Matej Lexa:
Triplex: an R/Bioconductor package for identification and visualization of potential intramolecular triplex patterns in DNA sequences. Bioinform. 29(15): 1900-1901 (2013) - 2012
- [c9]Matej Lexa, Lucie Navrátilová, Karel Nejedlý, Marie Brázdová:
Prediction of Significant Cruciform Structures from Sequence in Topologically Constrained DNA - A Probabilistic Modelling Approach. BIOINFORMATICS 2012: 124-130 - [c8]Vojtech Bystrý, Matej Lexa:
cswHMM: A Novel Context Switching Hidden Markov Model for Biological Sequence Analysis. BIOINFORMATICS 2012: 208-213 - 2011
- [j4]Matej Lexa, Tomás Martínek, Ivana Burgetova, Daniel Kopecek, Marie Brázdová:
A dynamic programming algorithm for identification of triplex-forming sequences. Bioinform. 27(18): 2510-2517 (2011) - [c7]Tomás Martínek, Matej Lexa:
Architecture model for approximate tandem repeat detection. ASAP 2011: 239-242 - 2010
- [c6]Tomás Martínek, Matej Lexa:
Hardware Acceleration of Approximate Tandem Repeat Detection. FCCM 2010: 79-86 - [c5]Ivana Rudolfova, Jaroslav Zendulka, Matej Lexa:
Clustering of Protein Substructures for Discovery of a Novel Class of Sequence-Structure Fragments. ITBAM 2010: 94-101
2000 – 2009
- 2009
- [c4]Tomás Martínek, Jan Vozenilek, Matej Lexa:
Architecture model for approximate palindrome detection. DDECS 2009: 90-95 - [p1]Matej Lexa, Václav Snásel, Ivan Zelinka:
Data-Mining Protein Structure by Clustering, Segmentation and Evolutionary Algorithms. Foundations of Computational Intelligence (4) 2009: 221-248 - 2008
- [c3]Tomás Martínek, Matej Lexa:
Hardware acceleration of approximate palindromes searching. FPT 2008: 65-72 - 2007
- [c2]Tomás Martínek, Otto Fucík, Patrik Beck, Matej Lexa:
Automatic Generation of Circuits for Approximate String Matching. DDECS 2007: 203-208 - 2006
- [c1]Tomás Martínek, Jan Korenek, Otto Fucík, Matej Lexa:
A Flexible Technique for the Automatic Design of Approximate String Matching Architectures. DDECS 2006: 83-84 - 2005
- [j3]Davide Campagna, Chiara Romualdi, Nicola Vitulo, Micky Del Favero, Matej Lexa, Nicola Cannata, Giorgio Valle:
RAP: a new computer program for de novo identification of repeated sequences in whole genomes. Bioinform. 21(5): 582-588 (2005) - 2003
- [j2]Matej Lexa, Giorgio Valle:
PRIMEX: rapid identification of oligonucleotide matches in whole genomes. Bioinform. 19(18): 2486-2488 (2003) - 2001
- [j1]Matej Lexa, J. Horak, Bretislav Brzobohaty:
Virtual PCR. Bioinform. 17(1): 192-193 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
