Zeshan Peng

According to our database, Zeshan Peng authored at least 16 papers between 2004 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

Toward assessing clinical trial publications for reporting transparency.

Halil Kilicoglu, Graciela Rosemblat, Linh K. Hoang, Sahil Wadhwa, Zeshan Peng, Mario Malicki, Jodi Schneider, Gerben ter Riet

J. Biomed. Informatics, 2021

2019

Confirm or refute?: A comparative study on citation sentiment classification in clinical research publications.

Halil Kilicoglu, Zeshan Peng, Shabnam Tafreshi, Tung Tran, Graciela Rosemblat, Jodi Schneider

J. Biomed. Informatics, 2019

2018

Toward Predicting Communication Effectiveness.

Zeshan Peng, Wenbo Wang, Bitty Balducci, Detelina Marinova, Yi Shang

Proceedings of the Third IEEE International Conference on Data Science in Cyberspace, 2018

2016

Mobile Data Collection and Analysis in Conservation.

Nickolas M. Wergeles, Charles Shang, Zeshan Peng, Haidong Wang, Joel Sartwell, Tom Treiman, Jeff Beringer, Jerrold L. Belant, Joshua J. Millspaugh, Jon T. McRoberts, Yi Shang

Proceedings of the 2016 IEEE International Conference on Smart Computing, 2016

2011

Algorithms for Finding a Most Similar Subforest.

Jesper Jansson, Zeshan Peng

Theory Comput. Syst., 2011

2008

From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time.

Vincent Berry, Zeshan Peng, H. F. Ting

Algorithmica, 2008

2007

Online and Dynamic Recognition of Squarefree Strings.

Jesper Jansson, Zeshan Peng

Int. J. Found. Comput. Sci., 2007

Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge.

Zeshan Peng, Hing-Fung Ting

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006

Structure comparison in bioinformatics

Zeshan Peng

PhD thesis, 2006

An efficient algorithm for online square detection.

Ho-fung Leung, Zeshan Peng, Hing-Fung Ting

Theor. Comput. Sci., 2006

An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees.

Zeshan Peng, Hing-Fung Ting

Inf. Process. Lett., 2006

2005

An Efficient Reduction from Constrained to Unconstrained Maximum Agreement Subtree.

Zeshan Peng, H. F. Ting

Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

Algorithms for Local Forest Similarity.

Zeshan Peng

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

Time and Space Efficient Algorithms for Constrained Sequence Alignment.

Zeshan Peng, H. F. Ting

Proceedings of the Implementation and Application of Automata, 2004

An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees.

Zeshan Peng, Hing-Fung Ting

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

An Efficient Online Algorithm for Square Detection.

Ho-fung Leung, Zeshan Peng, Hing-Fung Ting

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004