Lenore Cowen

Orcid: 0000-0001-6698-6413

Affiliations:
  • Tufts University, Medford, USA


According to our database1, Lenore Cowen authored at least 79 papers between 1986 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Quantifying Media Influence on Covid-19 Mask-Wearing Beliefs.
CoRR, 2024

The VOROS: Lifting ROC curves to 3D.
CoRR, 2024

2023
Investigating the effect of selective exposure, audience fragmentation, and echo-chambers on polarization in dynamic media ecosystems.
Appl. Netw. Sci., December, 2023

TT3D: Leveraging precomputed protein 3D sequence models to predict protein-protein interactions.
Bioinform., October, 2023

2022
Majority Vote Cascading: A Semi-Supervised Framework for Improving Protein Function Prediction.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022

GLIDER: function prediction from GLIDE-based neighborhoods.
Bioinform., 2022

MEDFORD: A human- and machine-readable metadata markup language.
Database J. Biol. Databases Curation, 2022

Cognitive Cascades within Media Ecosystems: Simulating Fragmentation, Selective Exposure and Media Tactics to Investigate Polarization.
Proceedings of the Complex Networks and Their Applications XI, 2022

Embodied Notes: A Cognitive Support Tool For Remote Scientific Collaboration in VR.
Proceedings of the CHI '22: CHI Conference on Human Factors in Computing Systems, New Orleans, LA, USA, 29 April 2022, 2022

Identifying Cognitive and Creative Support Needs for Remote Scientific Collaboration using VR: Practices, Affordances, and Design Implications.
Proceedings of the C&C '22: Creativity and Cognition, Venice, Italy, June 20 - 23, 2022, 2022

Combining spectral clustering and large cut algorithms to find compensatory functional modules from yeast physical and genetic interaction data with GLASS.
Proceedings of the BCB '22: 13th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics, Northbrook, Illinois, USA, August 7, 2022

Neighborhood embedding and re-ranking of disease genes with ADAGIO.
Proceedings of the BCB '22: 13th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics, Northbrook, Illinois, USA, August 7, 2022

2021
Diffusion State Distances: Multitemporal Analysis, Fast Algorithms, and Applications to Biological Networks.
SIAM J. Math. Data Sci., 2021

Cognitive Contagion: How to model (and potentially counter) the spread of fake news.
CoRR, 2021

Bioinformatics of corals: Investigating heterogeneous omics data from coral holobionts for insight into reef health and resillience.
Proceedings of the Biocomputing 2021: Proceedings of the Pacific Symposium, 2021

MEtaData Format for Open Reef Data (MEDFORD).
Proceedings of the Metadata and Semantic Research - 15th International Conference, 2021

Random-Walk Based Approximate k-Nearest Neighbors Algorithm for Diffusion State Distance.
Proceedings of the Large-Scale Scientific Computing - 13th International Conference, 2021

2020
Preface Special Issue: RECOMB 2019.
J. Comput. Biol., 2020

GLIDE: combining local methods and diffusion state embeddings to predict missing interactions in biological networks.
Bioinform., 2020

2018
Computing the diffusion state distance on graphs via algebraic multigrid and random projections.
Numer. Linear Algebra Appl., 2018

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

2017
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

2016
Packet Routing.
Encyclopedia of Algorithms, 2016

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

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

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

Compressive genomics for protein databases.
Bioinform., 2013

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

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

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

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

2011
Inferring Mechanisms of Compensation from E-MAP and SGA Data Using Local Search Algorithms for Max Cut.
J. Comput. Biol., 2011

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

2010
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. USA, 2010

Evaluating Between-Pathway Models with Expression Data.
J. Comput. Biol., 2010

Recognition of beta-structural motifs using hidden Markov models trained with simulated evolution.
Bioinform., 2010

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

2009
BETASCAN: Probable β-amyloids Identified by Pairwise Probabilistic Analysis.
PLoS Comput. Biol., 2009

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

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

Matt: Local Flexibility Aids Protein Multiple Structure Alignment.
PLoS Comput. Biol., 2008

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

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

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

2006
Compact Routing with Name Independence.
SIAM J. Discret. 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

2005
Wrap-and-Pack: A New Paradigm for Beta Structural Motif Recognition with Application to Recognizing Beta Trefoils.
J. Comput. Biol., 2005

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

The distinguishing number of the hypercube.
Discret. Math., 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

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

Predicting the Beta-Helix Fold from Protein Sequence Data.
J. Comput. Biol., 2002

Foreword.
Discret. Math., 2002

2001
Compact Routing with Minimum Stretch.
J. Algorithms, 2001

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

1999
On the local distinguishing numbers of cycles.
Discret. Math., 1999

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

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

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

1997
Defective coloring revisited.
J. Graph Theory, 1997

The Offset Problem.
Comb. Probab. Comput., 1997

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

1996
Hypercube sandwich approach to conferencing.
J. Supercomput., 1996

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

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

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

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

1994
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

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

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

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

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

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

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


  Loading...