{"action":"opened","issue":{"url":"https://api.github.com/repos/marbl/Mash/issues/95","repository_url":"https://api.github.com/repos/marbl/Mash","labels_url":"https://api.github.com/repos/marbl/Mash/issues/95/labels{/name}","comments_url":"https://api.github.com/repos/marbl/Mash/issues/95/comments","events_url":"https://api.github.com/repos/marbl/Mash/issues/95/events","html_url":"https://github.com/marbl/Mash/issues/95","id":355478998,"node_id":"MDU6SXNzdWUzNTU0Nzg5OTg=","number":95,"title":"Question : Custom parameters ofr long and erroneous ONT reads","user":{"login":"RxLoutre","id":13352219,"node_id":"MDQ6VXNlcjEzMzUyMjE5","avatar_url":"https://avatars2.githubusercontent.com/u/13352219?v=4","gravatar_id":"","url":"https://api.github.com/users/RxLoutre","html_url":"https://github.com/RxLoutre","followers_url":"https://api.github.com/users/RxLoutre/followers","following_url":"https://api.github.com/users/RxLoutre/following{/other_user}","gists_url":"https://api.github.com/users/RxLoutre/gists{/gist_id}","starred_url":"https://api.github.com/users/RxLoutre/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/RxLoutre/subscriptions","organizations_url":"https://api.github.com/users/RxLoutre/orgs","repos_url":"https://api.github.com/users/RxLoutre/repos","events_url":"https://api.github.com/users/RxLoutre/events{/privacy}","received_events_url":"https://api.github.com/users/RxLoutre/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2018-08-30T08:30:15Z","updated_at":"2018-08-30T08:30:15Z","closed_at":null,"author_association":"NONE","body":"Hello there,\r\n\r\nI've been trying to understand the principle of the MinHash algorithm. Although it is not the field I am used to, I understand that mash use MinHash in order to compress a sequence using the representative k-mers (it is called shingles right ?). That set of representativ k-mer is then encoded on 32 or 64 bits in a particular format that doesnt take a lot of memory but still allow comparison. I'm I right so far ?\r\n\r\nI'm working with Oxford Nanopore Reads, which may have a higher but evenly distributed error rate (~15%), with mostly insertion/deletion in homopolymers. I'm trying to use mash in order to check the content of my sketched raw reads, for now against the mashed RefSeq database I found on this place : https://mash.readthedocs.io/en/latest/data.html .\r\n\r\nI did several tests, each time with species that are present in RefSeq, but mash doesn't seem to work well and don't even show the right species in the first hits. For example, for data on a fish species, my 150 first result where mammals species.\r\n\r\nI feel like my high error rate in my reads will make it really hard to have a correct estimation. I would like to solve that problem. I'm already trying to perform a miniassembly of my reads (using minimap2/miniasm) to produce a kind of consensus to work with mash, but this is adding a really long step to the analysis without making a huge improvement on the results accuracy.\r\n\r\nI think there might be a way to play with the k parameter and maybe some other parameters I'm not thinking of while sketching with mash. I would like to know if anyone as a suggestion of parameters I could try to fit long and erroneous ONT reads.\r\n\r\nThanks in advance for your advices !\r\n\r\nCheers,\r\n\r\nRox"}}
{"actor":{"display_login":"RxLoutre"}}