{"action":"opened","issue":{"url":"https://api.github.com/repos/MullinsLab/simple-consensus-per-read-group/issues/1","labels_url":"https://api.github.com/repos/MullinsLab/simple-consensus-per-read-group/issues/1/labels{/name}","comments_url":"https://api.github.com/repos/MullinsLab/simple-consensus-per-read-group/issues/1/comments","events_url":"https://api.github.com/repos/MullinsLab/simple-consensus-per-read-group/issues/1/events","html_url":"https://github.com/MullinsLab/simple-consensus-per-read-group/issues/1","id":114360641,"number":1,"title":"Use a less dubious quality aggregation than the average","user":{"login":"tsibley","id":79913,"avatar_url":"https://avatars.githubusercontent.com/u/79913?v=3","gravatar_id":"","url":"https://api.github.com/users/tsibley","html_url":"https://github.com/tsibley","followers_url":"https://api.github.com/users/tsibley/followers","following_url":"https://api.github.com/users/tsibley/following{/other_user}","gists_url":"https://api.github.com/users/tsibley/gists{/gist_id}","starred_url":"https://api.github.com/users/tsibley/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/tsibley/subscriptions","organizations_url":"https://api.github.com/users/tsibley/orgs","repos_url":"https://api.github.com/users/tsibley/repos","events_url":"https://api.github.com/users/tsibley/events{/privacy}","received_events_url":"https://api.github.com/users/tsibley/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":0,"created_at":"2015-10-30T21:39:32Z","updated_at":"2015-10-30T21:39:32Z","closed_at":null,"body":"I think it would be reasonable and straightforward to adopt one of Geneious' approaches:\r\n\r\n* Sum of contributing bases minus sum of non-contributing bases\r\n* Highest of contributing bases"}}