Search Results - "Iliopoulos, Costas"

Refine Results
  1. 1

    GenMap: ultra-fast computation of genome mappability by Pockrandt, Christopher, Alzamel, Mai, Iliopoulos, Costas S, Reinert, Knut

    Published in Bioinformatics (01-06-2020)
    “…Abstract Motivation Computing the uniqueness of k-mers for each position of a genome while allowing for up to e mismatches is computationally challenging…”
    Get full text
    Journal Article
  2. 2

    Predicting the functional consequences of non-synonymous DNA sequence variants — evaluation of bioinformatics tools and development of a consensus strategy by Frousios, Kimon, Iliopoulos, Costas S., Schlitt, Thomas, Simpson, Michael A.

    Published in Genomics (San Diego, Calif.) (01-10-2013)
    “…The study of DNA sequence variation has been transformed by recent advances in DNA sequencing technologies. Determination of the functional consequences of…”
    Get full text
    Journal Article
  3. 3

    Efficient pattern matching in elastic-degenerate strings by Iliopoulos, Costas S., Kundu, Ritu, Pissis, Solon P.

    Published in Information and computation (01-08-2021)
    “…Motivated by applications in bioinformatics and image searching, in what follows, we study the classic pattern matching problem in the context of…”
    Get full text
    Journal Article
  4. 4

    IUPACpal: efficient identification of inverted repeats in IUPAC-encoded DNA sequences by Alamro, Hayam, Alzamel, Mai, Iliopoulos, Costas S, Pissis, Solon P, Watts, Steven

    Published in BMC bioinformatics (06-02-2021)
    “…An inverted repeat is a DNA sequence followed downstream by its reverse complement, potentially with a gap in the centre. Inverted repeats are found in both…”
    Get full text
    Journal Article
  5. 5

    Efficient Computation of Sequence Mappability by Charalampopoulos, Panagiotis, Iliopoulos, Costas S., Kociumaka, Tomasz, Pissis, Solon P., Radoszewski, Jakub, Straszyński, Juliusz

    Published in Algorithmica (01-05-2022)
    “…Sequence mappability is an important task in genome resequencing. In the ( k ,  m )-mappability problem, for a given sequence T of length n , the goal is to…”
    Get full text
    Journal Article
  6. 6
  7. 7

    Covering problems for partial words and for indeterminate strings by Crochemore, Maxime, Iliopoulos, Costas S., Kociumaka, Tomasz, Radoszewski, Jakub, Rytter, Wojciech, Waleń, Tomasz

    Published in Theoretical computer science (25-10-2017)
    “…Indeterminate strings are a subclass of non-standard words having non-deterministic nature. In a classic string every position contains exactly one symbol—we…”
    Get full text
    Journal Article
  8. 8

    Locating tandem repeats in weighted sequences in proteins by Zhang, Hui, Guo, Qing, Iliopoulos, Costas S

    Published in BMC bioinformatics (09-05-2013)
    “…A weighted biological sequence is a string in which a set of characters may appear at each position with respective probabilities of occurrence. We attempt to…”
    Get full text
    Journal Article
  9. 9

    Order-preserving indexing by Crochemore, Maxime, Iliopoulos, Costas S., Kociumaka, Tomasz, Kubica, Marcin, Langiu, Alessio, Pissis, Solon P., Radoszewski, Jakub, Rytter, Wojciech, Waleń, Tomasz

    Published in Theoretical computer science (25-07-2016)
    “…Kubica et al. [33] and Kim et al. [29] introduced order-preserving pattern matching: for a given text the goal is to find its factors having the same 'shape'…”
    Get full text
    Journal Article
  10. 10

    Linear-time superbubble identification algorithm for genome assembly by Brankovic, Ljiljana, Iliopoulos, Costas S., Kundu, Ritu, Mohamed, Manal, Pissis, Solon P., Vayani, Fatima

    Published in Theoretical computer science (04-01-2016)
    “…DNA sequencing is the process of determining the exact order of the nucleotide bases of an individual's genome in order to catalogue sequence variation and…”
    Get full text
    Journal Article
  11. 11

    Fast algorithms for approximate circular string matching by Barton, Carl, Iliopoulos, Costas S, Pissis, Solon P

    Published in Algorithms for molecular biology (22-03-2014)
    “…Circular string matching is a problem which naturally arises in many biological contexts. It consists in finding all occurrences of the rotations of a pattern…”
    Get full text
    Journal Article
  12. 12

    Transcriptome activity of isochores during preimplantation process in human and mouse by Barton, Carl, Iliopoulos, Costas S., Pissis, Solon P., Arhondakis, Stilianos

    Published in FEBS letters (01-07-2016)
    “…This work investigates the role of isochores during preimplantation process. Using RNA‐seq data from human and mouse preimplantation stages, we created the…”
    Get full text
    Journal Article
  13. 13

    Linear algorithm for conservative degenerate pattern matching by Crochemore, Maxime, Iliopoulos, Costas S., Kundu, Ritu, Mohamed, Manal, Vayani, Fatima

    “…A degenerate symbolx˜ over an alphabet Σ is a non-empty subset of Σ, and a sequence of such symbols is a degenerate string. A degenerate string is said to be…”
    Get full text
    Journal Article
  14. 14

    Hiding patients’ medical reports using an enhanced wavelet steganography algorithm in DICOM images by Ahmad, Mostafa A., Elloumi, Mourad, Samak, Ahmed H., Al-Sharafi, Ali M., Alqazzaz, Ali, Kaid, Monir Abdullah, Iliopoulos, Costas

    Published in Alexandria engineering journal (01-12-2022)
    “…In the latest years, there is an increasing emphasis on DICOM medical images, especially in digital medical images transmission to e-health services. Besides,…”
    Get full text
    Journal Article
  15. 15

    On avoided words, absent words, and their application to biological sequence analysis by Almirantis, Yannis, Charalampopoulos, Panagiotis, Gao, Jia, Iliopoulos, Costas S, Mohamed, Manal, Pissis, Solon P, Polychronopoulos, Dimitris

    Published in Algorithms for molecular biology (14-03-2017)
    “…The deviation of the observed frequency of a word from its expected frequency in a given sequence is used to determine whether or not the word is . This…”
    Get full text
    Journal Article
  16. 16

    Global and local sequence alignment with a bounded number of gaps by Barton, Carl, Flouri, Tomáš, Iliopoulos, Costas S., Pissis, Solon P.

    Published in Theoretical computer science (31-05-2015)
    “…Pairwise sequence alignment techniques have gained renewed interest in recent years, primarily due to their applications in re-sequencing—the assembly of a…”
    Get full text
    Journal Article
  17. 17

    Abelian borders in binary words by Christodoulakis, Manolis, Christou, Michalis, Crochemore, Maxime, Iliopoulos, Costas S.

    Published in Discrete Applied Mathematics (10-07-2014)
    “…In this article we study the appearance of abelian borders in binary words, a notion closely related to the abelian period of a word. We show how many binary…”
    Get full text
    Journal Article
  18. 18

    Circular sequence comparison: algorithms and applications by Grossi, Roberto, Iliopoulos, Costas S, Mercas, Robert, Pisanti, Nadia, Pissis, Solon P, Retha, Ahmad, Vayani, Fatima

    Published in Algorithms for molecular biology (10-05-2016)
    “…Sequence comparison is a fundamental step in many important tasks in bioinformatics; from phylogenetic reconstruction to the reconstruction of genomes…”
    Get full text
    Journal Article
  19. 19

    Transcriptome map of mouse isochores by Arhondakis, Stilianos, Frousios, Kimon, Iliopoulos, Costas S, Pissis, Solon P, Tischler, German, Kossida, Sophia

    Published in BMC genomics (17-10-2011)
    “…The availability of fully sequenced genomes and the implementation of transcriptome technologies have increased the studies investigating the expression…”
    Get full text
    Journal Article
  20. 20

    Efficient enumeration of non-equivalent squares in partial words with few holes by Charalampopoulos, Panagiotis, Crochemore, Maxime, Iliopoulos, Costas S., Kociumaka, Tomasz, Pissis, Solon P., Radoszewski, Jakub, Rytter, Wojciech, Waleń, Tomasz

    Published in Journal of combinatorial optimization (15-02-2019)
    “…A word of the form WW for some word W ∈ Σ ∗ is called a square. A partial word is a word possibly containing holes (also called don’t cares). The hole is a…”
    Get full text
    Journal Article