Lenwood S. Heath

85 papers A* 8A 4B 3C 1Misc 1Journal 56Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Reflections on the Presence of Human Cancer Genes in Primate Genomes. J. Comput. Biol. Xiao Liang, Lenwood S. Heath
2024	J	`jnl`	LINgroups as a Robust Principled Approach to Compare and Integrate Multiple Bacterial Taxonomies. IEEE ACM Trans. Comput. Biol. Bioinform. Reza Mazloom, N. Tessa Pierce-Ward, Parul Sharma, Leighton Pritchard, C. Titus Brown, Boris A. Vinatzer, Lenwood S. Heath
2022	—	`conf`	LINgroups as a principled approach to compare and integrate multiple bacterial taxonomies. BCB Reza Mazloom, Leighton Pritchard, C. Titus Brown, Boris A. Vinatzer, Lenwood S. Heath
2021	J	`jnl`	AgroSeek: a system for computational analysis of environmental metagenomic data and associated metadata. BMC Bioinform. Xiao Liang, Kyle Akers, Ishi Keenum, Lauren Wind, Suraj Gupta, Chaoqi Chen, Reem Aldaihani, Amy Pruden, Liqing Zhang, Katharine F. Knowlton, Kang Xia, Lenwood S. Heath
2021	J	`jnl`	MetaMLP: A Fast Word Embedding Based Classifier to Profile Target Gene Databases in Metagenomic Samples. J. Comput. Biol. Gustavo A. Arango-Argoty, Lenwood S. Heath, Amy Pruden, Peter J. Vikesland, Liqing Zhang
2020	—	`conf`	A Fast Word Embedding Based Classifier to Profile Target Gene Databases in Metagenomic Samples. ICCABS Gustavo A. Arango-Argoty, Lenwood S. Heath, Amy Pruden, Peter J. Vikesland, Liqing Zhang
2020	J	`jnl`	ARGminer: a web platform for the crowdsourcing-based curation of antibiotic resistance genes. Bioinform. Gustavo A. Arango-Argoty, G. K. P. Guron, Emily Garner, M. V. Riquelme, Lenwood S. Heath, Amy Pruden, Peter J. Vikesland, Liqing Zhang
2020	J	`jnl`	LINbase: a web server for genome-based identification of prokaryotes as members of crowdsourced taxa. Nucleic Acids Res. Long Tian, Chengjie Huang, Reza Mazloom, Lenwood S. Heath, Boris A. Vinatzer
2019	J	`jnl`	MCAT: Motif Combining and Association Tool. J. Comput. Biol. Yanshen Yang, Jeffrey A. Robertson, Zhen Guo, Jake Martinez, Christy A. Coghlan, Lenwood S. Heath
2017	J	`jnl`	Beacon Editor: Capturing Signal Transduction Pathways Using the Systems Biology Graphical Notation Activity Flow Language. J. Comput. Biol. Haitham Elmarakeby, Mostafa Arefiyan, Elijah Myers, Song Li, Ruth Grene, Lenwood S. Heath
2017	J	`jnl`	Bioinformatics of DNA [Scanning the Issue]. Proc. IEEE Lenwood S. Heath, Héctor Corrada Bravo, Mario Cáccamo, Michael Schatz
2017	J	`jnl`	MicroTarget: MicroRNA target gene prediction approach with application to breast cancer. J. Bioinform. Comput. Biol. Hanaa Torkey, Lenwood S. Heath, Mahmoud ElHefnawi
2017	J	`jnl`	New methods to generate massive synthetic networks. CoRR Malay Chakrabarti, Lenwood S. Heath, Naren Ramakrishnan
2017	J	`jnl`	PEAK: Integrating Curated and Noisy Prior Knowledge in Gene Regulatory Network Inference. J. Comput. Biol. Doaa Altarawy, Fatma-Elzahraa Eid, Lenwood S. Heath
2016	J	`jnl`	DeNovo: virus-host sequence-based protein-protein interaction prediction. Bioinform. Fatma-Elzahraa Eid, Mahmoud ElHefnawi, Lenwood S. Heath
2016	J	`jnl`	Labeled cuts in graphs. Theor. Comput. Sci. Tridib Dutta, Lenwood S. Heath, V. S. Anil Kumar, Madhav V. Marathe
2015	J	`jnl`	CoSREM: a graph mining algorithm for the discovery of combinatorial splicing regulatory elements. BMC Bioinform. Eman Badr, Lenwood S. Heath
2014	J	`jnl`	Identifying Splicing Regulatory Elements with de Bruijn Graphs. J. Comput. Biol. Eman Badr, Lenwood S. Heath
2013	J	`jnl`	Mining Posets from Linear Orders. Discret. Math. Algorithms Appl. Proceso L. Fernandez, Lenwood S. Heath, Naren Ramakrishnan, Michael Tan, John Paul C. Vergara
2012	Misc	`conf`	Sorting genomes using almost-symmetric inversions. SAC Zanoni Dias, Ulisses Dias, Lenwood S. Heath, João C. Setubal
2011	J	`jnl`	A Network of SCOP Hidden Markov Models and Its Analysis. BMC Bioinform. Liqing Zhang, Layne T. Watson, Lenwood S. Heath
2011	J	`jnl`	A Theoretical Model for Whole Genome Alignment. J. Comput. Biol. Nahla A. Belal, Lenwood S. Heath
2010	A*	`conf`	Extracting temporal signatures for comprehending systems biology models. KDD Naren Sundaravaradan, K. S. M. Tozammel Hossain, Vandana Sreedharan, Douglas J. Slotta, John Paul C. Vergara, Lenwood S. Heath, Naren Ramakrishnan
2009	J	`jnl`	Multimodal Networks: Structure and Operations. IEEE ACM Trans. Comput. Biol. Bioinform. Lenwood S. Heath, Allan A. Sioson
2009	J	`jnl`	Semantics of Multimodal Network Models. IEEE ACM Trans. Comput. Biol. Bioinform. Lenwood S. Heath, Allan A. Sioson
2008	J	`jnl`	CMGSDB: integrating heterogeneous Nucleic Acids Res. Amrita Pati, Ying Jin, Karsten Klage, Richard F. Helm, Lenwood S. Heath, Naren Ramakrishnan
2008	—	`conf`	Using Cost-Sensitive Learning to Determine Gene Conversions. ICIC (2) Mark J. Lawson, Lenwood S. Heath, Naren Ramakrishnan, Liqing Zhang
2007	—	`conf`	Genomic Signatures from DNA Word Graphs. ISBRA Lenwood S. Heath, Amrita Pati
2007	C	`conf`	Genomic Signatures in De Bruijn Chains. WABI Lenwood S. Heath, Amrita Pati
2007	—	`conf`	Predicting Markov Chain Order in Genomic Sequences. BIBM Lenwood S. Heath, Amrita Pati
2006	J	`jnl`	The statistics of identifying differentially expressed genes in Expresso and TM4: a comparison. BMC Bioinform. Allan A. Sioson, Shrinivasrao P. Mane, Pinghua Li, Wei Sha, Lenwood S. Heath, Hans J. Bohnert, Ruth Grene
2006	J	`jnl`	XcisClique: analysis of regulatory bicliques. BMC Bioinform. Amrita Pati, Cecilia Vasquez-Robinet, Lenwood S. Heath, Ruth Grene, T. M. Murali
2005	J	`jnl`	H++: a server for estimating p Nucleic Acids Res. John C. Gordon, Jonathan B. Myers, Timothy Folta, Valia Shoja, Lenwood S. Heath, Alexey Onufriev
2005	J	`jnl`	The PMU Placement Problem. SIAM J. Discret. Math. Dennis J. Brueni, Lenwood S. Heath
2004	J	`jnl`	New algorithms for generating Conway polynomials over finite fields. J. Symb. Comput. Lenwood S. Heath, Nicholas A. Loehr
2003	A	`conf`	Expresso and Chips: Creating a Next Generation Microarray Experiment Management System. IPDPS Allan A. Sioson, Jonathan I. Watkinson, Cecilia Vasquez-Robinet, Margaret Ellis, Maulik Shukla, Deept Kumar, Naren Ramakrishnan, Lenwood S. Heath, Ruth Grene, Boris I. Chevone, Karen Kafadar, Layne T. Watson
2003	J	`jnl`	Sorting by Short Swaps. J. Comput. Biol. Lenwood S. Heath, John Paul C. Vergara
2002	—	`conf`	Networks in Bioinformatics. ISPAN Lenwood S. Heath
2002	J	`jnl`	The Emerging Landscape of Bioinformatics Software Systems. Computer Lenwood S. Heath, Naren Ramakrishnan
2001	J	`jnl`	Constructing Homomorphism Spaces and Endomorphism Rings. J. Symb. Comput. Edward L. Green, Lenwood S. Heath, Craig A. Struble
2001	—	`book`	Graph separators with applications. Arnold L. Rosenberg, Lenwood S. Heath
2001	J	`jnl`	The Expresso Microarray Experiment Management System: The Functional Genomics of Stress Responses in Loblolly Pine CoRR Lenwood S. Heath, Naren Ramakrishnan, Ronald R. Sederoff, Ross W. Whetten, Boris I. Chevone, Craig A. Struble, Vincent Y. Jouenne, Dawei Chen, Leonel van Zyl, Ruth G. Alscher
2001	J	`jnl`	The pagenumber of k-trees is O(k). Discret. Appl. Math. Joseph L. Ganley, Lenwood S. Heath
2000	B	`conf`	Constructing endomorphism rings via duals. ISSAC Edward L. Green, Lenwood S. Heath, Craig A. Struble
2000	J	`jnl`	Sorting by Short Block-Moves. Algorithmica Lenwood S. Heath, John Paul C. Vergara
1999	B	`conf`	Efficient Construction of Drinfel'd Doubles. ISSAC Gerard P. Brunick, Edward L. Green, Lenwood S. Heath, Craig A. Struble
1999	A*	`conf`	New Algorithms for Generating Conway Polynomials Over Finite Fields. SODA Lenwood S. Heath, Nicholas A. Loehr
1999	J	`jnl`	Stack and Queue Layouts of Directed Acyclic Graphs: Part I. SIAM J. Comput. Lenwood S. Heath, Sriram V. Pemmaraju, Ann N. Trenk
1999	J	`jnl`	Stack and Queue Layouts of Directed Acyclic Graphs: Part II. SIAM J. Comput. Lenwood S. Heath, Sriram V. Pemmaraju
1998	J	`jnl`	An Experimental Evaluation of Local Search Heuristics for Graph Partitioning. Computing Joseph L. Ganley, Lenwood S. Heath
1998	J	`jnl`	Edge-Packing in Planar Graphs. Theory Comput. Syst. Lenwood S. Heath, John Paul C. Vergara
1998	J	`jnl`	Edge-packing Planar Graphs by Cyclic Graphs. Discret. Appl. Math. Lenwood S. Heath, John Paul C. Vergara
1998	J	`jnl`	Sorting by Bounded Block-moves. Discret. Appl. Math. Lenwood S. Heath, John Paul C. Vergara
1997	J	`jnl`	Graph Embeddings and Simplicial Maps. Theory Comput. Syst. Lenwood S. Heath
1997	—	`conf`	Opal: A System for Computing Noncommutative Gröbner Bases. RTA Edward L. Green, Lenwood S. Heath, Benjamin J. Keller
1997	J	`jnl`	Stack and Queue Layouts of Posets. SIAM J. Discret. Math. Lenwood S. Heath, Sriram V. Pemmaraju
1996	A	`conf`	Using the Swan data structure visualization system for computer science education. SIGCSE Clifford A. Shaffer, Lenwood S. Heath, Jun Yang
1996	A*	`conf`	Visualizing Search Results: Some Alternatives to Query-Document Similarity. SIGIR Lucy T. Nowell, Robert K. France, Deborah Hix, Lenwood S. Heath, Edward A. Fox
1995	J	`jnl`	Envision: A User-Centered Database of Computer Science Literature. Commun. ACM Lenwood S. Heath, Deborah Hix, Lucy T. Nowell, William C. Wake, Guillermo A. Averboch, Eric Labow, Scott A. Guyer, Dennis J. Brueni, Robert K. France, Kaushal Dalal, Edward A. Fox
1995	A	`conf`	Recognizing Leveled-Planar Dags in Linear Time. GD Lenwood S. Heath, Sriram V. Pemmaraju
1995	A	`conf`	SWAN: A Data Structure Visualization System. GD Jun Yang, Clifford A. Shaffer, Lenwood S. Heath
1994	J	`jnl`	Heuristics for laying out information graphs. Computing Joseph L. Ganley, Lenwood S. Heath
1994	J	`jnl`	New Results for the Minimum Weight Triangulation Problem. Algorithmica Lenwood S. Heath, Sriram V. Pemmaraju
1994	J	`jnl`	Optimal and Random Partitions of Random Graphs. Comput. J. Joseph L. Ganley, Lenwood S. Heath
1993	J	`jnl`	Generalized comparison of quadtree and bintree storage requirements. Image Vis. Comput. Clifford A. Shaffer, Ramana Juvvadi, Lenwood S. Heath
1993	B	`conf`	Lower Bounds for Graph Embeddings via Algebraic Topology. SPAA Lenwood S. Heath
1993	J	`jnl`	Representing Polyhedra: Faces Are Better Than Vertices. Comput. Geom. Lenwood S. Heath, Praveen K. Paripati, John W. Roach
1993	J	`jnl`	Users, User Interfaces, and Objects: Envision, a Digital Library. J. Am. Soc. Inf. Sci. Edward A. Fox, Deborah Hix, Lucy T. Nowell, Dennis J. Brueni, William C. Wake, Lenwood S. Heath, Durgesh Rao
1993	—	`conf`	What If There Were Desktop Access to the Computer Science Literature? ACM Conference on Computer Science Dennis J. Brueni, Baziley T. Cross, Edward A. Fox, Lenwood S. Heath, Deborah Hix, Lucy T. Nowell, William C. Wake
1992	A*	`conf`	A Faster Algorithm for Constructing Minimal Perfect Hash Functions. SIGIR Edward A. Fox, Qi Fan Chen, Lenwood S. Heath
1992	J	`jnl`	Comparing Queues and Stacks as Mechanisms for Laying out Graphs. SIAM J. Discret. Math. Lenwood S. Heath, Frank Thomson Leighton, Arnold L. Rosenberg
1992	—	`ch.`	Hashing Algorithms. Information Retrieval: Data Structures & Algorithms Steven P. Wartik, Edward A. Fox, Lenwood S. Heath, Qi Fan Chen
1992	J	`jnl`	Laying out Graphs Using Queues. SIAM J. Comput. Lenwood S. Heath, Arnold L. Rosenberg
1992	J	`jnl`	Practical Minimal Perfect Hash Functions for Large Databases. Commun. ACM Edward A. Fox, Lenwood S. Heath, Qi Fan Chen, Amjad M. Daoud
1992	J	`jnl`	The Pagenumber of Genus g Graphs is O(g). J. ACM Lenwood S. Heath, Sorin Istrail
1991	A*	`conf`	Edge Coloring Planar Graphs with Two Outerplanar Subgraphs. SODA Lenwood S. Heath
1991	J	`jnl`	Order-Preserving Minimal Perfect Hash Functions and Information Retrieval. ACM Trans. Inf. Syst. Edward A. Fox, Qi Fan Chen, Amjad M. Daoud, Lenwood S. Heath
1991	—	`conf`	Stack and Queue Layouts of Directed Planar Graphs. Planar Graphs Lenwood S. Heath, Sriram V. Pemmaraju, Ann N. Trenk
1990	J	`jnl`	Covering a Set with Arithmetic Progressions is NP-Complete. Inf. Process. Lett. Lenwood S. Heath
1990	J	`jnl`	Optimal Embeddings of Butterfly-Like Graphs in the Hypercube. Math. Syst. Theory David S. Greenberg, Lenwood S. Heath, Arnold L. Rosenberg
1990	A*	`conf`	Order Preserving Minimal Perfect Hash Functions and Information Retrieval. SIGIR Edward A. Fox, Qi Fan Chen, Amjad M. Daoud, Lenwood S. Heath
1989	—	`conf`	A More Cost Effective Algorithm for Finding Perfect Hash Functions. ACM Conference on Computer Science Edward A. Fox, Qi Fan Chen, Lenwood S. Heath, Sanjeev Datta
1988	J	`jnl`	The physical mapping problem for parallel architectures. J. ACM Lenwood S. Heath, Arnold L. Rosenberg, Bruce T. Smith
1987	A*	`conf`	The Pagenumber of Genus g Graphs is O(g) STOC Lenwood S. Heath, Sorin Istrail
1984	A*	`conf`	Embedding Planar Graphs in Seven Pages FOCS Lenwood S. Heath