Lenwood S. Heath

According to our database1, Lenwood S. Heath authored at least 75 papers between 1984 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 



On csauthors.net:


ARGminer: a web platform for the crowdsourcing-based curation of antibiotic resistance genes.
Bioinform., 2020

MCAT: Motif Combining and Association Tool.
J. Comput. Biol., 2019

Bioinformatics of DNA [Scanning the Issue].
Proc. IEEE, 2017

Beacon Editor: Capturing Signal Transduction Pathways Using the Systems Biology Graphical Notation Activity Flow Language.
J. Comput. Biol., 2017

PEAK: Integrating Curated and Noisy Prior Knowledge in Gene Regulatory Network Inference.
J. Comput. Biol., 2017

MicroTarget: MicroRNA target gene prediction approach with application to breast cancer.
J. Bioinform. Comput. Biol., 2017

New methods to generate massive synthetic networks.
CoRR, 2017

Labeled cuts in graphs.
Theor. Comput. Sci., 2016

DeNovo: virus-host sequence-based protein-protein interaction prediction.
Bioinform., 2016

CoSREM: a graph mining algorithm for the discovery of combinatorial splicing regulatory elements.
BMC Bioinform., 2015

Identifying Splicing Regulatory Elements with de Bruijn Graphs.
J. Comput. Biol., 2014

Mining Posets from Linear Orders.
Discret. Math. Algorithms Appl., 2013

Sorting genomes using almost-symmetric inversions.
Proceedings of the ACM Symposium on Applied Computing, 2012

A Theoretical Model for Whole Genome Alignment.
J. Comput. Biol., 2011

A Network of SCOP Hidden Markov Models and Its Analysis.
BMC Bioinform., 2011

Extracting temporal signatures for comprehending systems biology models.
Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2010

Multimodal Networks: Structure and Operations.
IEEE ACM Trans. Comput. Biol. Bioinform., 2009

Semantics of Multimodal Network Models.
IEEE ACM Trans. Comput. Biol. Bioinform., 2009

CMGSDB: integrating heterogeneous <i>Caenorhabditis elegans</i> data sources using compositional data mining.
Nucleic Acids Res., 2008

Using Cost-Sensitive Learning to Determine Gene Conversions.
Proceedings of the Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 2008

Genomic Signatures in De Bruijn Chains.
Proceedings of the Algorithms in Bioinformatics, 7th International Workshop, 2007

Genomic Signatures from DNA Word Graphs.
Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007

Predicting Markov Chain Order in Genomic Sequences.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2007

The statistics of identifying differentially expressed genes in Expresso and TM4: a comparison.
BMC Bioinform., 2006

XcisClique: analysis of regulatory bicliques.
BMC Bioinform., 2006

The PMU Placement Problem.
SIAM J. Discret. Math., 2005

H++: a server for estimating p<i>K</i><sub>a</sub>s and adding missing hydrogens to macromolecules.
Nucleic Acids Res., 2005

New algorithms for generating Conway polynomials over finite fields.
J. Symb. Comput., 2004

Sorting by Short Swaps.
J. Comput. Biol., 2003

Expresso and Chips: Creating a Next Generation Microarray Experiment Management System.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

The Emerging Landscape of Bioinformatics Software Systems.
Computer, 2002

Networks in Bioinformatics.
Proceedings of the International Symposium on Parallel Architectures, 2002

Constructing Homomorphism Spaces and Endomorphism Rings.
J. Symb. Comput., 2001

The pagenumber of k-trees is O(k).
Discret. Appl. Math., 2001

The Expresso Microarray Experiment Management System: The Functional Genomics of Stress Responses in Loblolly Pine
CoRR, 2001

Graph separators with applications.
Frontiers of computer science, Kluwer, ISBN: 978-0-306-46464-5, 2001

Sorting by Short Block-Moves.
Algorithmica, 2000

Constructing endomorphism rings via duals.
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

Stack and Queue Layouts of Directed Acyclic Graphs: Part I.
SIAM J. Comput., 1999

Stack and Queue Layouts of Directed Acyclic Graphs: Part II.
SIAM J. Comput., 1999

Efficient Construction of Drinfel'd Doubles.
Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

Edge-Packing in Planar Graphs.
Theory Comput. Syst., 1998

Sorting by Bounded Block-moves.
Discret. Appl. Math., 1998

Edge-packing Planar Graphs by Cyclic Graphs.
Discret. Appl. Math., 1998

An Experimental Evaluation of Local Search Heuristics for Graph Partitioning.
Computing, 1998

Stack and Queue Layouts of Posets.
SIAM J. Discret. Math., 1997

Graph Embeddings and Simplicial Maps.
Theory Comput. Syst., 1997

Opal: A System for Computing Noncommutative Gröbner Bases.
Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

Visualizing Search Results: Some Alternatives to Query-Document Similarity.
Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 1996

Using the Swan data structure visualization system for computer science education.
Proceedings of the 27th SIGCSE Technical Symposium on Computer Science Education, 1996

Envision: A User-Centered Database of Computer Science Literature.
Commun. ACM, 1995

SWAN: A Data Structure Visualization System.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 1995

Recognizing Leveled-Planar Dags in Linear Time.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 1995

Heuristics for laying out information graphs.
Computing, 1994

Optimal and Random Partitions of Random Graphs.
Comput. J., 1994

New Results for the Minimum Weight Triangulation Problem.
Algorithmica, 1994

Users, User Interfaces, and Objects: Envision, a Digital Library.
J. Am. Soc. Inf. Sci., 1993

Generalized comparison of quadtree and bintree storage requirements.
Image Vis. Comput., 1993

Representing Polyhedra: Faces Are Better Than Vertices.
Comput. Geom., 1993

Lower Bounds for Graph Embeddings via Algebraic Topology.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

What If There Were Desktop Access to the Computer Science Literature?
Proceedings of the ACM 21th Conference on Computer Science, 1993

Comparing Queues and Stacks as Mechanisms for Laying out Graphs.
SIAM J. Discret. Math., 1992

Laying out Graphs Using Queues.
SIAM J. Comput., 1992

The Pagenumber of Genus g Graphs is O(g).
J. ACM, 1992

Practical Minimal Perfect Hash Functions for Large Databases.
Commun. ACM, 1992

A Faster Algorithm for Constructing Minimal Perfect Hash Functions.
Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Copenhagen, 1992

Hashing Algorithms.
Proceedings of the Information Retrieval: Data Structures & Algorithms, 1992

Order-Preserving Minimal Perfect Hash Functions and Information Retrieval.
ACM Trans. Inf. Syst., 1991

Edge Coloring Planar Graphs with Two Outerplanar Subgraphs.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Stack and Queue Layouts of Directed Planar Graphs.
Proceedings of the Planar Graphs, 1991

Optimal Embeddings of Butterfly-Like Graphs in the Hypercube.
Math. Syst. Theory, 1990

Covering a Set with Arithmetic Progressions is NP-Complete.
Inf. Process. Lett., 1990

A More Cost Effective Algorithm for Finding Perfect Hash Functions.
Proceedings of the Computer Trends in the 1990s, 1989

The physical mapping problem for parallel architectures.
J. ACM, 1988

Embedding Planar Graphs in Seven Pages
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984