A reference data set of 5.4 million phased human variants validated by genetic inheritance from sequencing a three-generation 17-member pedigree

MA Eberle, E Fritzilas, P Krusche, M Källberg… - Genome …, 2017 - genome.cshlp.org
Improvement of variant calling in next-generation sequence data requires a comprehensive,
genome-wide catalog of high-confidence variants called in a set of genomes for use as a …

Massive parallel bisulfite sequencing of CG-rich DNA fragments reveals that methylation of many X-chromosomal CpG islands in female blood DNA is incomplete

…, C Sirsch, K Buiting, S Gross, E Fritzilas… - Human molecular …, 2009 - academic.oup.com
Methylation of CpG islands (CGIs) plays an important role in gene silencing. For genome-wide
methylation analysis of CGIs in female white blood cells and in sperm, we used four …

Modelling cross‐hybridization on phylogenetic DNA microarrays increases the detection power of closely related species

…, M Wolf, J Schultz, E Fritzilas… - Molecular Ecology …, 2009 - Wiley Online Library
DNA microarrays are a popular technique for the detection of microorganisms. Several
approaches using specific oligomers targeting one or a few marker genes for each species have …

[HTML][HTML] Using a secure, continually updating, web source processing pipeline to support the real-time data synthesis and analysis of scientific literature: development …

…, P Bratsos, G Martin, E Fritzilas… - Journal of Medical …, 2021 - publichealth.jmir.org
… This paper is in the following e-collection/theme issue: … Author Orcid Image ;
Epameinondas Fritzilas 2 … This paper is in the following e-collection/theme issue: …

[HTML][HTML] Resilience and optimization of identifiable bipartite graphs

E Fritzilas, M Milanič, J Monnot… - Discrete Applied …, 2013 - Elsevier
A bipartite graph G=(L,R;E) with at least one edge is said to be identifiable if for every vertex
v∈L, the subgraph induced by its non-neighbors has a matching of cardinality |L|−1. This …

Structural identifiability in low-rank matrix factorization

E Fritzilas, M Milanič, S Rahmann, YA Rios-Solis - Algorithmica, 2010 - Springer
In many signal processing and data mining applications, we need to approximate a given
matrix Y with a low-rank product Y≈AX. Both matrices A and X are to be determined, but we …

Algebraic algorithms for structure determination in biological chemistry

IZ Emiris, ED Fritzilas… - International journal of …, 2006 - Wiley Online Library
Several problems in computational chemistry, structural molecular biology, and biological
chemistry can be solved by symbolic‐numerical algorithms. We introduce suitable algebraic …

Structural identifiability in low-rank matrix factorization

E Fritzilas, YA Rios-Solis, S Rahmann - … 2008 Dalian, China, June 27-29 …, 2008 - Springer
… We represent a zero pattern Z as a bipartite graph G(Z) = (R ∪ C, E), where the vertex
partitions R and C correspond to the rows and columns of Z, respectively, and the edges E

[PDF][PDF] Combinatorial aspects of low-rank matrix factorization and two applications in bioinformatics

E Fritzilas - 2009 - core.ac.uk
In many signal processing and data mining applications we need to approximate a given
matrix Y with a low-rank product Y≈ AX. Both matrices A and X have to be determined and we …

[PDF][PDF] A reference dataset of 5.4 million human variants validated by genetic inheritance from sequencing a three-generation 17-member pedigree

MA Eberle, E Fritzilas, P Krusche, M Källberg… - academia.edu
Improvement of variant calling in next-generation sequence data requires a comprehensive,
genomewide catalogue of high-confidence variants called in a set of genomes for use as a …