Lenore Cowen

According to our database1, Lenore Cowen authored at least 61 papers between 1986 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 



On csauthors.net:


Majority Vote Cascading: A Semi-Supervised Framework for Improving Protein Function Prediction.
Proceedings of the 10th ACM International Conference on Bioinformatics, 2019

Computing the diffusion state distance on graphs via algebraic multigrid and random projections.
Numerical Lin. Alg. with Applic., 2018

Highlights Talks at ACM BCB 2018.
Proceedings of the 2018 ACM International Conference on Bioinformatics, 2018

When should we NOT transfer functional annotation between sequence paralogs?
Proceedings of the Biocomputing 2017: Proceedings of the Pacific Symposium, 2017

Detangling PPI Networks to Uncover Functionally Meaningful Clusters.
Proceedings of the 8th ACM International Conference on Bioinformatics, 2017

Packet Routing.
Encyclopedia of Algorithms, 2016

MRFy: Remote Homology Detection for Beta-Structural Proteins Using Markov Random Fields and Stochastic Search.
IEEE/ACM Trans. Comput. Biology Bioinform., 2015

New directions for diffusion-based network prediction of protein function: incorporating pathways with confidence.
Bioinformatics, 2014

Genecentric: a package to uncover graph-theoretic structure in high-throughput epistasis data.
BMC Bioinformatics, 2013

Compressive genomics for protein databases.
Bioinformatics, 2013

Molli: Interactive Visualization for Exploratory Protein Analysis.
IEEE Computer Graphics and Applications, 2012

Formatt: Correcting Protein Multiple Structural Alignments by Incorporating Sequence Alignment.
BMC Bioinformatics, 2012

SMURFLite: combining simplified Markov random fields with simulated evolution improves remote homology detection for beta-structural proteins into the twilight zone.
Bioinformatics, 2012

Remote homology detection on alpha-structural proteins using simulated evolution.
Proceedings of the ACM International Conference on Bioinformatics, 2012

Inferring Mechanisms of Compensation from E-MAP and SGA Data Using Local Search Algorithms for Max Cut.
Journal of Computational Biology, 2011

Formatt: correcting protein multiple structural alignments by sequence peeking.
Proceedings of the ACM International Conference on Bioinformatics, 2011

Markov random fields reveal an N-terminal double beta-propeller motif as part of a bacterial hybrid two-component sensor system.
Proc. Natl. Acad. Sci. U.S.A., 2010

Evaluating Between-Pathway Models with Expression Data.
Journal of Computational Biology, 2010

Recognition of beta-structural motifs using hidden Markov models trained with simulated evolution.
Bioinformatics [ISMB], 2010

Touring Protein Space with Matt.
Proceedings of the Bioinformatics Research and Applications, 6th International Symposium, 2010

BETASCAN: Probable β-amyloids Identified by Pairwise Probabilistic Analysis.
PLoS Computational Biology, 2009

Augmented training of hidden Markov models to recognize remote homologs via simulated evolution.
Bioinformatics, 2009

Packet Routing.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Matt: Local Flexibility Aids Protein Multiple Structure Alignment.
PLoS Computational Biology, 2008

Compact roundtrip routing with topology-independent node names.
J. Comput. Syst. Sci., 2008

Totally Greedy Coin Sets and Greedy Obstructions.
Electr. J. Comb., 2008

A Distance-Based Method for Detecting Horizontal Gene Transfer in Whole Genomes.
Proceedings of the Bioinformatics Research and Applications, 2008

Compact Routing with Name Independence.
SIAM J. Discrete Math., 2006

Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Compact routing with additive stretch using distance labelings.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Compact Routing on Power Law Graphs with Additive Stretch.
Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

Wrap-and-Pack: A New Paradigm for Beta Structural Motif Recognition with Application to Recognizing Beta Trefoils.
Journal of Computational Biology, 2005

Compact roundtrip routing in directed networks.
J. Algorithms, 2004

The distinguishing number of the hypercube.
Discrete Mathematics, 2004

Approximation Algorithms for the Class Cover Problem.
Ann. Math. Artif. Intell., 2004

Wrap-and-pack: a new paradigm for beta structural motif recognition with application to recognizing beta trefoils.
Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004

Guest Editor's Foreword.
J. Comput. Syst. Sci., 2002

Predicting the Beta-Helix Fold from Protein Sequence Data.
Journal of Computational Biology, 2002

Discrete Mathematics, 2002

Compact Routing with Minimum Stretch.
J. Algorithms, 2001

Compact roundtrip routing in directed networks (extended abstract).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

On the local distinguishing numbers of cycles.
Discrete Mathematics, 1999

Compact Roundtrip Routing for Digraphs.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Near-Linear Time Construction of Sparse Neighborhood Covers.
SIAM J. Comput., 1998

A Formal Framework for Evaluating Heuristic Programs.
Ann. Math. Artif. Intell., 1998

Defective coloring revisited.
Journal of Graph Theory, 1997

The Offset Problem.
Combinatorics, Probability & Computing, 1997

Coloring with Defect.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Hypercube sandwich approach to conferencing.
The Journal of Supercomputing, 1996

Fast Distributed Network Decompositions and Covers.
J. Parallel Distrib. Comput., 1996

The Offset Problem (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Asymptotic enumeration of full graphs.
Journal of Graph Theory, 1995

Scheduling with Concurrency-Based Constraints.
J. Algorithms, 1995

Low-Diameter Graph Decomposition Is in NC.
Random Struct. Algorithms, 1994

Efficient asynchronous distributed symmetry breaking.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Concurrence Probabilities for a Locally Slotted Packet Radio Network by Combinatorial Methods.
Perform. Eval., 1993

Near-Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood Covers
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

Fast Network Decomposition (Extended Abstract).
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

Complexity Results and Algorithms for { <, <=, = }-Constrained Scheduling.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

On the Structure of Secret Key Exchange Protocols.
Proceedings of the Distributed Computing And Cryptography, 1989

Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency.
Journal of Graph Theory, 1986