TensorFlow Implementation of the paper "End-to-End Relation Extraction using LSTMs on Sequences and Tree Structures" and "Classifying Relations via Long Short Term Memory Networks along Shortest Dependency Paths" for classifying relations
Some time ago, I ran into this reddit post commenting on how (open source) projects could really benefit from better descriptions of what they do and why. I think we can also learn from this thread, and especially the comment referring to [this](https://github.com/ddbeck/readme-checklist/blob/master/c
gTaxon - a fast cross-platform NCBI taxonomy data querying (gi2taxid, taxid2taxon, name2taxid, LCA) tool, with cmd client and REST API server for both local and remote server.
Students have noted that 'Their flowchart has about a hundred processes, and it looks very messy, they would benefit from a function to group processes in blackboxes'
A DFS algorithm implementation to find the minimum time to conquer all nodes from root. It takes 1 minute time from one node to its child and the node can conquer its child one at a time. Find the minimum time.
Some time ago, I ran into this reddit post commenting on how (open source) projects could really benefit from better descriptions of what they do and why. I think we can also learn from this thread, and especially the comment referring to [this](https://github.com/ddbeck/readme-checklist/blob/master/c