Jerzy W. Jaromczyk

According to our database1, Jerzy W. Jaromczyk authored at least 62 papers between 1981 and 2024.

Collaborative distances:



In proceedings 
PhD thesis 




RNA-clique: a method for computing genetic distances from RNA-seq data.
BMC Bioinform., December, 2024

Optimization Perspectives on Shellsort.
CoRR, 2023

Curricular Complexity Versus Quality of Computer Science Programs.
CoRR, 2020

An exercise in repeating experimental analysis using a program developed on a no longer available computing system.
Proceedings of the ACMSE 2018 Conference, Richmond, KY, USA, March 29-31, 2018, 2018

Proceedings of the 16th Annual UT-KBRIN Bioinformatics Summit 2016: bioinformatics: Burns, TN, USA. April 21-23, 2017.
BMC Bioinform., September, 2017

Rapid and Reusable Text Visualization and Exploration Development with DELVE.
Proceedings of the Summit on Clinical Research Informatics, 2017

Proceedings of the 15th Annual UT-KBRIN Bioinformatics Summit 2016: Cadiz, KY, USA. 8-10 April 2016.
BMC Bioinform., August, 2016

Comparison of Network Architectures for a Telemetry System in the Solar Car Project.
Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, 2016

Validation and quality assurance for genome browser database exports.
BMC Bioinform., December, 2015

Automating deployment of several GBrowse instances.
BMC Bioinform., 2014

An adaptive landscape for training in the essentials of next gen sequencing data acquisition and bioinformatic analysis.
BMC Bioinform., 2014

Video game bots as a theme for student software competitions.
Proceedings of the Computer Games: AI, 2014

Using HPC for teaching and learning bioinformatics software: Benefits and challenges.
BMC Bioinform., 2013

FPD2GB2: Automating a transition from a customized genome browser to GBrowse2.
BMC Bioinform., 2013

Teaching graphics for games using Microsoft XNA.
Proceedings of the 18th International Conference on Computer Games: AI, 2013

Constructions of asymptotically shortest k-radius sequences.
J. Comb. Theory A, 2012

A linear-time algorithm for finding a maximum-length ORF in a splice graph.
Int. J. Comput. Biol. Drug Des., 2012

Finding long protein products of alternatively spliced genes.
BMC Bioinform., 2012

An efficient secure comparison protocol.
Proceedings of the 2012 IEEE International Conference on Intelligence and Security Informatics, 2012

Modelling car drivers as believable autonomous agents for a traffic control training game.
Proceedings of the 17th International Conference on Computer Games, 2012

MSCTrees: a mean-shift based toolkit for cluster analysis of phylogenetic trees.
BMC Bioinform., 2011

Privacy preserving two-party k-means clustering over vertically partitioned dataset.
Proceedings of the 2011 IEEE International Conference on Intelligence and Security Informatics, 2011

Privacy preserving spectral clustering over vertically partitioned data sets.
Proceedings of the Eighth International Conference on Fuzzy Systems and Knowledge Discovery, 2011

Finding a longest open reading frame of an alternatively spliced gene.
Proceedings of the 2011 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2011

Experimenting with database segmentation size vs time performance for mpiBLAST on an IBM HS21 blade cluster.
BMC Bioinform., 2010

<i>Phylotree</i> - a toolkit for computing experiments with distance-based methods for genome coevolution.
BMC Bioinform., 2010

Visualizing and sharing results in bioinformatics projects: GBrowse and GenBank exports.
BMC Bioinform., 2009

MedSurv: a software application for creating, conducting and managing medical surveys and questionnaires.
BMC Bioinform., 2008

Making the SAT decision Based on a DNA Computation.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007

The genetic algorithm scheme for consensus sequences.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007

Support for XML markup of image-based electronic editions.
Int. J. Digit. Libr., 2006

Simulations of Microreactors: The Order of Things.
Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

Building Image-based Electronic Editions using the Edition Production Technology.
Bull. IEEE Tech. Comm. Digit. Libr., 2005

Simulation and Visualization for DNA Computing in Microreactors.
Proceedings of the Advances in Natural Computation, First International Conference, 2005

Comput. Geom., 2004

A web interface to image-based concurrent markup using image maps.
Proceedings of the Sixth ACM CIKM International Workshop on Web Information and Data Management (WIDM 2004), 2004

Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

On Visualization of Complex Image-Basedmarkup.
Proceedings of the International Conference on Computer Vision and Graphics, 2004

Visualizing Articular Cartilage using Expectation Maximization to Compare Segmentation Ofmrimages by Independent raters.
Proceedings of the International Conference on Computer Vision and Graphics, 2004

RepeatAssembler: A Package for Annotation of Full-Length Repetitive DNA Sequences in Fungal Genomes.
Proceedings of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004

Sets of lines and cutting out polyhedral objects.
Comput. Geom., 2003

Local optimization of triangular surface meshes for general quadrics in lp norm.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

The Face-Wise Continuity in Hot Wire Cutting of Polyhedral Sets.
EuroCG, 2000

A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem.
Comput. Geom., 1999

A Theory of Even Functionals and Their Algorithmic Applications.
Theor. Comput. Sci., 1996

The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

A geometric proof of the combinatorial bounds the number of optimal solutions for the 2-center euclidean problem.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

Computing Convex Hull in a Floating Point Arithmetic.
Comput. Geom., 1994

An Efficient Algorithm for the Euclidean Two-Center Problem.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Numerical Stability of a Convex Hull Algorithm for Simple Polygons.
Algorithmica, 1993

Relative neighborhood graphs and their relatives.
Proc. IEEE, 1992

A role of lower semicontinuous functions in the combinatorial complexity of geometric problems.
J. Complex., 1991

Constructing the relative neighborhood graph in 3-dimensional Euclidean space.
Discret. Appl. Math., 1991

A Note on Lower Bounds for the Maximum Area and Maximum Perimeter (kappa)k-gon Problems.
Inf. Process. Lett., 1989

Skewed Projections with an Application to Line Stabbing in R3.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

Investigating Logical Properties of the Rule-Based Expert Systems Using Combinatorial and Geometrical Techniques I.
Proceedings of the Methodologies for Intelligent Systems, 1987

A Note on Relative Neighborhood Graphs.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

Some results on decision trees with relations to computational trees.
Proceedings of the Computation Theory, 1984

Lower Bounds for Polygon Simplicity Testing and Other Problems.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

Linear Decision Trees are too Weak for Convex Hull Problem.
Inf. Process. Lett., 1981

An Extension of Rabin's Complete Proof Concept.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

Lower Bounds for Problems Defined by Polynomial Inequalities.
Proceedings of the Fundamentals of Computation Theory, 1981