Yannis Almirantis

Dr. Yannis Almirantis


Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 April 2015 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
GTGeorge Tsatsaronis
George Tsatsaronis
GBGeorgios Balikas
Georgios Balikas
PMProdromos Malakasiotis
Prodromos Malakasiotis
IPIoannis Partalas
Ioannis Partalas
MZMatthias Zschunke
Matthias Zschunke
GPGeorgios Paliouras
Georgios Paliouras
This article provides an overview of the first BioASQ challenge, a competition on large-scale biomedical semantic indexing and question answering (QA), which took place between March and September 2013. BioASQ assesses the ability of systems to semantically index very large numbers of biomedical scientific articles, and to return concise and user-understandable answers to given natural language questions by combining information from biomedical articles and ontologies.

1 August 2014 in Genomics
Verified
Journal Article
Closed access
DPDimitris Polychronopoulos
Dimitris Polychronopoulos
EWEmanuel Weitschek
Emanuel Weitschek
SDSlavica Dimitrieva
Slavica Dimitrieva
PBPhilipp Bucher
Philipp Bucher
GFGiovanni Felici
Giovanni Felici
YAYannis Almirantis
Yannis Almirantis

14 March 2017 in Algorithms for Molecular Biology
Verified
Journal Article
Open access
PDF file
YAYannis Almirantis
Yannis Almirantis
PCPanagiotis Charalampopoulos
Panagiotis Charalampopoulos
JGJia Gao
Jia Gao
CICostas S. Iliopoulos
Costas S. Iliopoulos
MMManal Mohamed
Manal Mohamed
DPDimitris Polychronopoulos
Dimitris Polychronopoulos
The deviation of the observed frequency of a word w from its expected frequency in a given sequence x is used to determine whether or not the word is avoided. This concept is particularly useful in DNA linguistic analysis. The value of the deviation of w, denoted by $$\textit{dev}(w)$$ dev ( w ) , effectively characterises the extent of a word by its edge contrast in the context in which it occurs. A word w of length $$k>2$$ k > 2 is a $$\rho $$ ρ -avoided word in x if $$\textit{dev}(w) \le \rho $$ dev ( w ) ≤ ρ , for a given threshold $$\rho < 0$$ ρ < 0 . Notice that such a word may be completely absent from x. Hence, computing all such words naïvely can be a very time-consuming procedure, in particular for large k. In this article, we propose an $$\mathcal {O}(n)$$ O ( n ) -time and $$\mathcal {O}(n)$$ O ( n ) -space algorithm to compute all $$\rho $$ ρ -avoided words of length k in a given sequence of length n over a fixed-sized alphabet. We also present a time-optimal $$\mathcal {O}(\sigma n)$$ O ( σ n ) -time algorithm to compute all $$\rho $$ ρ -avoided words (of any length) in a sequence of length n over an integer alphabet of size $$\sigma $$ σ . In addition, we provide a tight asymptotic upper bound for the number of $$\rho $$ ρ -avoided words over an integer alphabet and the expected length of the longest one. We make available an implementation of our algorithm. Experimental results, using both real and synthetic data, show the efficiency and applicability of our implementation in biological sequence analysis. The systematic search for avoided words is particularly useful for biological sequence analysis. We present a linear-time and linear-space algorithm for the computation of avoided words of length k in a given sequence x. We suggest a modification to this algorithm so that it computes all avoided words of x, irrespective of their length, within the same time complexity. We also present combinatorial results with regards to avoided words and absent words.