Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lukasz Roguski

dblp:146/0810 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
1since 2021 · last 2021
0000-0003-2764-962XORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 4 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 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
3 papers
Bioinformatics and computational biology · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › bioinformatics infrastructure
FASTQ compression
0.522018
FaStore: a space-saving solution for raw sequencing data · Bioinform. 2018
DSRC 2 - Industry-oriented compression of FASTQ files · Bioinform. 2014
Bioinformatics and computational biology › genomics
genomic data compression
0.522018
FaStore: a space-saving solution for raw sequencing data · Bioinform. 2018
DSRC 2 - Industry-oriented compression of FASTQ files · Bioinform. 2014
Bioinformatics and computational biology › genomics › genomic data compression
lossy compression
0.312018
FaStore: a space-saving solution for raw sequencing data · Bioinform. 2018
Bioinformatics and computational biology › bioinformatics infrastructure
read compression
0.212015
Disk-based compression of data from genome sequencing · Bioinform. 2015
Bioinformatics and computational biology
sequence analysis
0.212015
Disk-based compression of data from genome sequencing · Bioinform. 2015
Bioinformatics and computational biology › genomics
variant calling
0.112018
FaStore: a space-saving solution for raw sequencing data · Bioinform. 2018
Storage systems
data compression
0.112014
DSRC 2 - Industry-oriented compression of FASTQ files · Bioinform. 2014
Storage systems › data compression
lossless compression
0.112014
DSRC 2 - Industry-oriented compression of FASTQ files · Bioinform. 2014

Methods — techniques the papers use, named apart from their topics

entropy coding · 0.4lossy compression · 0.3lossless compression · 0.3minimizer · 0.2burrows-wheeler transform · 0.2
YearPublicationVenuePosition
2021 Multi-domain clinical natural language processing with MedCAT: The Medical Concept Annotation Toolkit
Zeljko Kraljevic, Thomas Searle, Anthony Shek, Lukasz Roguski, Kawsar Noor, Daniel Bean, Aurelie Mascio, Leilei Zhu, Amos Folarin, Angus Roberts, Rebecca Bendayan, Mark P. Richardson, Robert Stewart 0002, Anoop D. Shah, Wai Keong Wong, Zina M. Ibrahim, James T. Teo, Richard J. B. Dobson
Artif. Intell. Medicine4
2020 Natural Language Processing for Mimicking Clinical Trial Recruitment in Critical Care: A Semi-Automated Simulation Based on the LeoPARDS Trial
abstract
Clinical trials often fail to recruit an adequate number of appropriate patients. Identifying eligible trial participants is resource-intensive when relying on manual review of clinical notes, particularly in critical care settings where the time window is short. Automated review of electronic health records (EHR) may help, but much of the information is in free text rather than a computable form. We applied natural language processing (NLP) to free text EHR data using the CogStack platform to simulate recruitment into the LeoPARDS study, a clinical trial aiming to reduce organ dysfunction in septic shock. We applied an algorithm to identify eligible patients using a moving 1-hour time window, and compared patients identified by our approach with those actually screened and recruited for the trial, for the time period that data were available. We manually reviewed records of a random sample of patients identified by the algorithm but not screened in the original trial. Our method identified 376 patients, including 34 patients with EHR data available who were actually recruited to LeoPARDS in our centre. The sensitivity of CogStack for identifying patients screened was 90% (95% CI 85%, 93%). Of the 203 patients identified by both manual screening and CogStack, the index date matched in 95 (47%) and CogStack was earlier in 94 (47%). In conclusion, analysis of EHR data using NLP could effectively replicate recruitment in a critical care trial, and identify some eligible patients at an earlier stage, potentially improving trial recruitment if implemented in real time.
Hegler Tissot, Anoop D. Shah, David Brealey, Steve K. Harris, Ruth Agbakoba, Amos Folarin, Luis Romao, Lukasz Roguski, Richard J. B. Dobson, Folkert W. Asselbergs
IEEE J. Biomed. Health Informatics8
2018 FaStore: a space-saving solution for raw sequencing data
abstract
Motivation: The affordability of DNA sequencing has led to the generation of unprecedented volumes of raw sequencing data. These data must be stored, processed and transmitted, which poses significant challenges. To facilitate this effort, we introduce FaStore, a specialized compressor for FASTQ files. FaStore does not use any reference sequences for compression and permits the user to choose from several lossy modes to improve the overall compression ratio, depending on the specific needs. Results: FaStore in the lossless mode achieves a significant improvement in compression ratio with respect to previously proposed algorithms. We perform an analysis on the effect that the different lossy modes have on variant calling, the most widely used application for clinical decision making, especially important in the era of precision medicine. We show that lossy compression can offer significant compression gains, while preserving the essential genomic information and without affecting the variant calling performance. Availability and implementation: FaStore can be downloaded from https://github.com/refresh-bio/FaStore. Supplementary information: Supplementary data are available at Bioinformatics online.
Lukasz Roguski, Idoia Ochoa, Mikel Hernaez, Sebastian Deorowicz
Bioinform.1
2015 Disk-based compression of data from genome sequencing
abstract
MOTIVATION: High-coverage sequencing data have significant, yet hard to exploit, redundancy. Most FASTQ compressors cannot efficiently compress the DNA stream of large datasets, since the redundancy between overlapping reads cannot be easily captured in the (relatively small) main memory. More interesting solutions for this problem are disk based, where the better of these two, from Cox et al. (2012), is based on the Burrows-Wheeler transform (BWT) and achieves 0.518 bits per base for a 134.0 Gbp human genome sequencing collection with almost 45-fold coverage. RESULTS: We propose overlapping reads compression with minimizers, a compression algorithm dedicated to sequencing reads (DNA only). Our method makes use of a conceptually simple and easily parallelizable idea of minimizers, to obtain 0.317 bits per base as the compression ratio, allowing to fit the 134.0 Gbp dataset into only 5.31 GB of space. AVAILABILITY AND IMPLEMENTATION: http://sun.aei.polsl.pl/orcom under a free license. CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Szymon Grabowski, Sebastian Deorowicz, Lukasz Roguski
Bioinform.3
2014 DSRC 2 - Industry-oriented compression of FASTQ files
abstract
SUMMARY: Modern sequencing platforms produce huge amounts of data. Archiving them raises major problems but is crucial for reproducibility of results, one of the most fundamental principles of science. The widely used gzip compressor, used for reduction of storage and transfer costs, is not a perfect solution, so a few specialized FASTQ compressors were proposed recently. Unfortunately, they are often impractical because of slow processing, lack of support for some variants of FASTQ files or instability. We propose DSRC 2 that offers compression ratios comparable with the best existing solutions, while being a few times faster and more flexible. AVAILABILITY AND IMPLEMENTATION: DSRC 2 is freely available at http://sun.aei.polsl.pl/dsrc. The package contains command-line compressor, C and Python libraries for easy integration with existing software and technical documentation with examples of usage. CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Lukasz Roguski, Sebastian Deorowicz
Bioinform.1