{"action":"opened","issue":{"url":"https://api.github.com/repos/BD2KGenomics/hgvm/issues/146","labels_url":"https://api.github.com/repos/BD2KGenomics/hgvm/issues/146/labels{/name}","comments_url":"https://api.github.com/repos/BD2KGenomics/hgvm/issues/146/comments","events_url":"https://api.github.com/repos/BD2KGenomics/hgvm/issues/146/events","html_url":"https://github.com/BD2KGenomics/hgvm/issues/146","id":103114962,"number":146,"title":"Write trivial graph variant caller","user":{"login":"adamnovak","id":5062495,"avatar_url":"https://avatars.githubusercontent.com/u/5062495?v=3","gravatar_id":"","url":"https://api.github.com/users/adamnovak","html_url":"https://github.com/adamnovak","followers_url":"https://api.github.com/users/adamnovak/followers","following_url":"https://api.github.com/users/adamnovak/following{/other_user}","gists_url":"https://api.github.com/users/adamnovak/gists{/gist_id}","starred_url":"https://api.github.com/users/adamnovak/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/adamnovak/subscriptions","organizations_url":"https://api.github.com/users/adamnovak/orgs","repos_url":"https://api.github.com/users/adamnovak/repos","events_url":"https://api.github.com/users/adamnovak/events{/privacy}","received_events_url":"https://api.github.com/users/adamnovak/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":0,"created_at":"2015-08-25T20:54:07Z","updated_at":"2015-08-25T20:54:07Z","closed_at":null,"body":"It should take GAM-format reads, count up how many cover each base of a graph, and emit calls accordingly. It should also try to identify novel variants that occur repeatedly in aligned reads."}}