{"repository":{"description":"Creates a neighbor-joining tree from a set of sequences, using maximum likelihood distances based on pairwise sequence alignment","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":316,"owner":"frederic-mahe","private":false,"open_issues":2,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Python","created_at":"2013-09-08T09:22:29-07:00","pushed_at":"2013-09-14T09:35:13-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Frédéric Mahé","company":"Technische Universität","blog":"http://mahé.org/","location":"Kaiserslautern, Germany","email":"72c7c4a588acf4bb44f8138a268dc836c009e86d@rhrk.uni-kl.de"},"url":"https://github.com/frederic-mahe/pairdist/compare/badd014b75...3567828aeb"}