default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLenwood S. Heath
Person information
- affiliation: Virginia Tech, Blacksburg, Virginia, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[c27]Reza Mazloom, Leighton Pritchard, C. Titus Brown, Boris A. Vinatzer, Lenwood S. Heath:
LINgroups as a principled approach to compare and integrate multiple bacterial taxonomies. BCB 2022: 55:1-55:7- 2021
- [j52]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:
AgroSeek: a system for computational analysis of environmental metagenomic data and associated metadata. BMC Bioinform. 22(1): 117 (2021) - [j51]Gustavo A. Arango-Argoty, Lenwood S. Heath, Amy Pruden, Peter J. Vikesland, Liqing Zhang:
MetaMLP: A Fast Word Embedding Based Classifier to Profile Target Gene Databases in Metagenomic Samples. J. Comput. Biol. 28(11): 1063-1074 (2021) - 2020
- [j50]Gustavo A. Arango-Argoty, G. K. P. Guron, Emily Garner, M. V. Riquelme, Lenwood S. Heath, Amy Pruden, Peter J. Vikesland, Liqing Zhang:
ARGminer: a web platform for the crowdsourcing-based curation of antibiotic resistance genes. Bioinform. 36(9): 2966-2973 (2020) - [j49]Long Tian, Chengjie Huang, Reza Mazloom, Lenwood S. Heath, Boris A. Vinatzer:
LINbase: a web server for genome-based identification of prokaryotes as members of crowdsourced taxa. Nucleic Acids Res. 48(Webserver-Issue): W529-W537 (2020) - [c26]Gustavo A. Arango-Argoty, Lenwood S. Heath, Amy Pruden, Peter J. Vikesland, Liqing Zhang:
A Fast Word Embedding Based Classifier to Profile Target Gene Databases in Metagenomic Samples. ICCABS 2020: 116-126
2010 – 2019
- 2019
- [j48]Yanshen Yang, Jeffrey A. Robertson, Zhen Guo, Jake Martinez, Christy A. Coghlan, Lenwood S. Heath:
MCAT: Motif Combining and Association Tool. J. Comput. Biol. 26(1): 1-15 (2019) - 2017
- [j47]Hanaa Torkey, Lenwood S. Heath, Mahmoud ElHefnawi:
MicroTarget: MicroRNA target gene prediction approach with application to breast cancer. J. Bioinform. Comput. Biol. 15(4): 1750013:1-1750013:17 (2017) - [j46]Doaa Altarawy, Fatma-Elzahraa Eid, Lenwood S. Heath:
PEAK: Integrating Curated and Noisy Prior Knowledge in Gene Regulatory Network Inference. J. Comput. Biol. 24(9): 863-873 (2017) - [j45]Haitham Elmarakeby, Mostafa Arefiyan, Elijah Myers, Song Li, Ruth Grene, Lenwood S. Heath:
Beacon Editor: Capturing Signal Transduction Pathways Using the Systems Biology Graphical Notation Activity Flow Language. J. Comput. Biol. 24(12): 1226-1229 (2017) - [j44]Lenwood S. Heath, Héctor Corrada Bravo, Mario Cáccamo, Michael Schatz:
Bioinformatics of DNA [Scanning the Issue]. Proc. IEEE 105(3): 419-421 (2017) - [i2]Malay Chakrabarti, Lenwood S. Heath, Naren Ramakrishnan:
New methods to generate massive synthetic networks. CoRR abs/1705.08473 (2017) - 2016
- [j43]Fatma-Elzahraa Eid, Mahmoud ElHefnawi, Lenwood S. Heath:
DeNovo: virus-host sequence-based protein-protein interaction prediction. Bioinform. 32(8): 1144-1150 (2016) - [j42]Tridib Dutta, Lenwood S. Heath, V. S. Anil Kumar, Madhav V. Marathe:
Labeled cuts in graphs. Theor. Comput. Sci. 648: 34-39 (2016) - 2015
- [j41]Eman Badr, Lenwood S. Heath:
CoSREM: a graph mining algorithm for the discovery of combinatorial splicing regulatory elements. BMC Bioinform. 16: 285:1-285:15 (2015) - 2014
- [j40]Eman Badr, Lenwood S. Heath:
Identifying Splicing Regulatory Elements with de Bruijn Graphs. J. Comput. Biol. 21(12): 880-897 (2014) - 2013
- [j39]Proceso L. Fernandez, Lenwood S. Heath, Naren Ramakrishnan, Michael Tan, John Paul C. Vergara:
Mining Posets from Linear Orders. Discret. Math. Algorithms Appl. 5(4) (2013) - 2012
- [c25]Zanoni Dias, Ulisses Dias, Lenwood S. Heath, João C. Setubal:
Sorting genomes using almost-symmetric inversions. SAC 2012: 1368-1374 - 2011
- [j38]Liqing Zhang, Layne T. Watson, Lenwood S. Heath:
A Network of SCOP Hidden Markov Models and Its Analysis. BMC Bioinform. 12: 191 (2011) - [j37]Nahla A. Belal, Lenwood S. Heath:
A Theoretical Model for Whole Genome Alignment. J. Comput. Biol. 18(5): 705-728 (2011) - 2010
- [c24]Naren Sundaravaradan, K. S. M. Tozammel Hossain, Vandana Sreedharan, Douglas J. Slotta, John Paul C. Vergara, Lenwood S. Heath, Naren Ramakrishnan:
Extracting temporal signatures for comprehending systems biology models. KDD 2010: 453-462
2000 – 2009
- 2009
- [j36]Lenwood S. Heath, Allan A. Sioson:
Semantics of Multimodal Network Models. IEEE ACM Trans. Comput. Biol. Bioinform. 6(2): 271-280 (2009) - [j35]Lenwood S. Heath, Allan A. Sioson:
Multimodal Networks: Structure and Operations. IEEE ACM Trans. Comput. Biol. Bioinform. 6(2): 321-332 (2009) - 2008
- [j34]Amrita Pati, Ying Jin, Karsten Klage, Richard F. Helm, Lenwood S. Heath, Naren Ramakrishnan:
CMGSDB: integrating heterogeneous Caenorhabditis elegans data sources using compositional data mining. Nucleic Acids Res. 36(Database-Issue): 69-76 (2008) - [c23]Mark J. Lawson, Lenwood S. Heath, Naren Ramakrishnan, Liqing Zhang:
Using Cost-Sensitive Learning to Determine Gene Conversions. ICIC (2) 2008: 1030-1038 - 2007
- [c22]Lenwood S. Heath, Amrita Pati:
Predicting Markov Chain Order in Genomic Sequences. BIBM 2007: 159-164 - [c21]Lenwood S. Heath, Amrita Pati:
Genomic Signatures from DNA Word Graphs. ISBRA 2007: 317-328 - [c20]Lenwood S. Heath, Amrita Pati:
Genomic Signatures in De Bruijn Chains. WABI 2007: 216-227 - 2006
- [j33]Allan A. Sioson, Shrinivasrao P. Mane, Pinghua Li, Wei Sha, Lenwood S. Heath, Hans J. Bohnert, Ruth Grene:
The statistics of identifying differentially expressed genes in Expresso and TM4: a comparison. BMC Bioinform. 7: 215 (2006) - [j32]Amrita Pati, Cecilia Vasquez-Robinet, Lenwood S. Heath, Ruth Grene, T. M. Murali:
XcisClique: analysis of regulatory bicliques. BMC Bioinform. 7: 218 (2006) - 2005
- [j31]John C. Gordon, Jonathan B. Myers, Timothy Folta, Valia Shoja, Lenwood S. Heath, Alexey Onufriev:
H++: a server for estimating pKas and adding missing hydrogens to macromolecules. Nucleic Acids Res. 33(Web-Server-Issue): 368-371 (2005) - [j30]Dennis J. Brueni, Lenwood S. Heath:
The PMU Placement Problem. SIAM J. Discret. Math. 19(3): 744-761 (2005) - 2004
- [j29]Lenwood S. Heath, Nicholas A. Loehr:
New algorithms for generating Conway polynomials over finite fields. J. Symb. Comput. 38(2): 1003-1024 (2004) - 2003
- [j28]Lenwood S. Heath, John Paul C. Vergara:
Sorting by Short Swaps. J. Comput. Biol. 10(5): 775-789 (2003) - [c19]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:
Expresso and Chips: Creating a Next Generation Microarray Experiment Management System. IPDPS 2003: 209 - 2002
- [j27]Lenwood S. Heath, Naren Ramakrishnan:
The Emerging Landscape of Bioinformatics Software Systems. Computer 35(7): 41-45 (2002) - [c18]Lenwood S. Heath:
Networks in Bioinformatics. ISPAN 2002: 141- - 2001
- [b1]Arnold L. Rosenberg, Lenwood S. Heath:
Graph separators with applications. Frontiers of computer science, Kluwer 2001, ISBN 978-0-306-46464-5, pp. I-XII, 1-257 - [j26]Joseph L. Ganley, Lenwood S. Heath:
The pagenumber of k-trees is O(k). Discret. Appl. Math. 109(3): 215-221 (2001) - [j25]Edward L. Green, Lenwood S. Heath, Craig A. Struble:
Constructing Homomorphism Spaces and Endomorphism Rings. J. Symb. Comput. 32(1/2): 101-117 (2001) - [i1]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:
The Expresso Microarray Experiment Management System: The Functional Genomics of Stress Responses in Loblolly Pine. CoRR cs.OH/0110047 (2001) - 2000
- [j24]Lenwood S. Heath, John Paul C. Vergara:
Sorting by Short Block-Moves. Algorithmica 28(3): 323-354 (2000) - [c17]Edward L. Green, Lenwood S. Heath, Craig A. Struble:
Constructing endomorphism rings via duals. ISSAC 2000: 129-136
1990 – 1999
- 1999
- [j23]Lenwood S. Heath, Sriram V. Pemmaraju, Ann N. Trenk:
Stack and Queue Layouts of Directed Acyclic Graphs: Part I. SIAM J. Comput. 28(4): 1510-1539 (1999) - [j22]Lenwood S. Heath, Sriram V. Pemmaraju:
Stack and Queue Layouts of Directed Acyclic Graphs: Part II. SIAM J. Comput. 28(5): 1588-1626 (1999) - [c16]Gerard P. Brunick, Edward L. Green, Lenwood S. Heath, Craig A. Struble:
Efficient Construction of Drinfel'd Doubles. ISSAC 1999: 45-52 - [c15]Lenwood S. Heath, Nicholas A. Loehr:
New Algorithms for Generating Conway Polynomials Over Finite Fields. SODA 1999: 429-437 - 1998
- [j21]Joseph L. Ganley, Lenwood S. Heath:
An Experimental Evaluation of Local Search Heuristics for Graph Partitioning. Computing 60(2): 121-132 (1998) - [j20]Lenwood S. Heath, John Paul C. Vergara:
Edge-packing Planar Graphs by Cyclic Graphs. Discret. Appl. Math. 81(1-3): 169-180 (1998) - [j19]Lenwood S. Heath, John Paul C. Vergara:
Sorting by Bounded Block-moves. Discret. Appl. Math. 88(1-3): 181-206 (1998) - [j18]Lenwood S. Heath, John Paul C. Vergara:
Edge-Packing in Planar Graphs. Theory Comput. Syst. 31(6): 629-662 (1998) - 1997
- [j17]Lenwood S. Heath:
Graph Embeddings and Simplicial Maps. Theory Comput. Syst. 30(1): 51-65 (1997) - [j16]Lenwood S. Heath, Sriram V. Pemmaraju:
Stack and Queue Layouts of Posets. SIAM J. Discret. Math. 10(4): 599-625 (1997) - [c14]Edward L. Green, Lenwood S. Heath, Benjamin J. Keller:
Opal: A System for Computing Noncommutative Gröbner Bases. RTA 1997: 331-334 - 1996
- [c13]Clifford A. Shaffer, Lenwood S. Heath, Jun Yang:
Using the Swan data structure visualization system for computer science education. SIGCSE 1996: 140-144 - [c12]Lucy T. Nowell, Robert K. France, Deborah Hix, Lenwood S. Heath, Edward A. Fox:
Visualizing Search Results: Some Alternatives to Query-Document Similarity. SIGIR 1996: 67-75 - 1995
- [j15]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:
Envision: A User-Centered Database of Computer Science Literature. Commun. ACM 38(4): 52-53 (1995) - [c11]Lenwood S. Heath, Sriram V. Pemmaraju:
Recognizing Leveled-Planar Dags in Linear Time. GD 1995: 300-311 - [c10]Jun Yang, Clifford A. Shaffer, Lenwood S. Heath:
SWAN: A Data Structure Visualization System. GD 1995: 520-523 - 1994
- [j14]Lenwood S. Heath, Sriram V. Pemmaraju:
New Results for the Minimum Weight Triangulation Problem. Algorithmica 12(6): 533-552 (1994) - [j13]Joseph L. Ganley, Lenwood S. Heath:
Optimal and Random Partitions of Random Graphs. Comput. J. 37(7): 641-643 (1994) - [j12]Joseph L. Ganley, Lenwood S. Heath:
Heuristics for laying out information graphs. Computing 52(4): 389-405 (1994) - 1993
- [j11]Lenwood S. Heath, Praveen K. Paripati, John W. Roach:
Representing Polyhedra: Faces Are Better Than Vertices. Comput. Geom. 3: 327-351 (1993) - [j10]Clifford A. Shaffer, Ramana Juvvadi, Lenwood S. Heath:
Generalized comparison of quadtree and bintree storage requirements. Image Vis. Comput. 11(7): 402-412 (1993) - [j9]Edward A. Fox, Deborah Hix, Lucy T. Nowell, Dennis J. Brueni, William C. Wake, Lenwood S. Heath, Durgesh Rao:
Users, User Interfaces, and Objects: Envision, a Digital Library. J. Am. Soc. Inf. Sci. 44(8): 480-491 (1993) - [c9]Dennis J. Brueni, Baziley T. Cross, Edward A. Fox, Lenwood S. Heath, Deborah Hix, Lucy T. Nowell, William C. Wake:
What If There Were Desktop Access to the Computer Science Literature? ACM Conference on Computer Science 1993: 15-22 - [c8]Lenwood S. Heath:
Lower Bounds for Graph Embeddings via Algebraic Topology. SPAA 1993: 311-317 - 1992
- [j8]Edward A. Fox, Lenwood S. Heath, Qi Fan Chen, Amjad M. Daoud:
Practical Minimal Perfect Hash Functions for Large Databases. Commun. ACM 35(1): 105-121 (1992) - [j7]Lenwood S. Heath, Sorin Istrail:
The Pagenumber of Genus g Graphs is O(g). J. ACM 39(3): 479-501 (1992) - [j6]Lenwood S. Heath, Arnold L. Rosenberg:
Laying out Graphs Using Queues. SIAM J. Comput. 21(5): 927-958 (1992) - [j5]Lenwood S. Heath, Frank Thomson Leighton, Arnold L. Rosenberg:
Comparing Queues and Stacks as Mechanisms for Laying out Graphs. SIAM J. Discret. Math. 5(3): 398-412 (1992) - [c7]Edward A. Fox, Qi Fan Chen, Lenwood S. Heath:
A Faster Algorithm for Constructing Minimal Perfect Hash Functions. SIGIR 1992: 266-273 - [p1]Steven P. Wartik, Edward A. Fox, Lenwood S. Heath, Qi Fan Chen:
Hashing Algorithms. Information Retrieval: Data Structures & Algorithms 1992: 293-362 - 1991
- [j4]Edward A. Fox, Qi Fan Chen, Amjad M. Daoud, Lenwood S. Heath:
Order-Preserving Minimal Perfect Hash Functions and Information Retrieval. ACM Trans. Inf. Syst. 9(3): 281-308 (1991) - [c6]Lenwood S. Heath, Sriram V. Pemmaraju, Ann N. Trenk:
Stack and Queue Layouts of Directed Planar Graphs. Planar Graphs 1991: 5-11 - [c5]Lenwood S. Heath:
Edge Coloring Planar Graphs with Two Outerplanar Subgraphs. SODA 1991: 195-202 - 1990
- [j3]Lenwood S. Heath:
Covering a Set with Arithmetic Progressions is NP-Complete. Inf. Process. Lett. 34(6): 293-298 (1990) - [j2]David S. Greenberg, Lenwood S. Heath, Arnold L. Rosenberg:
Optimal Embeddings of Butterfly-Like Graphs in the Hypercube. Math. Syst. Theory 23(1): 61-77 (1990) - [c4]Edward A. Fox, Qi Fan Chen, Amjad M. Daoud, Lenwood S. Heath:
Order Preserving Minimal Perfect Hash Functions and Information Retrieval. SIGIR 1990: 279-311
1980 – 1989
- 1989
- [c3]Edward A. Fox, Qi Fan Chen, Lenwood S. Heath, Sanjeev Datta:
A More Cost Effective Algorithm for Finding Perfect Hash Functions. ACM Conference on Computer Science 1989: 114-122 - 1988
- [j1]Lenwood S. Heath, Arnold L. Rosenberg, Bruce T. Smith:
The physical mapping problem for parallel architectures. J. ACM 35(3): 603-634 (1988) - 1987
- [c2]Lenwood S. Heath, Sorin Istrail:
The Pagenumber of Genus g Graphs is O(g). STOC 1987: 388-397 - 1984
- [c1]Lenwood S. Heath:
Embedding Planar Graphs in Seven Pages. FOCS 1984: 74-83
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 00:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
