Multiseed Lossless Filtration. Kucherov, G., Noe, L., & Roytberg, M. 2(1):51–61. Paper doi abstract bibtex We study a method of seed-based lossless filtration for approximate string matching and related bioinformatics applications. The method is based on a simultaneous use of several spaced seeds rather than a single seed as studied by Burkhardt and Kärkkäinen [1]. We present algorithms to compute several important parameters of seed families, study their combinatorial properties, and describe several techniques to construct efficient families. We also report a large-scale application of the proposed technique to the problem of oligonucleotide selection for an EST sequence database.
@article{kucherovMultiseedLosslessFiltration2005,
title = {Multiseed Lossless Filtration},
author = {Kucherov, G. and Noe, L. and Roytberg, M.},
date = {2005-01},
journaltitle = {Computational Biology and Bioinformatics, IEEE/ACM Transactions on},
volume = {2},
pages = {51--61},
issn = {1545-5963},
doi = {10.1109/tcbb.2005.12},
url = {https://doi.org/10.1109/tcbb.2005.12},
abstract = {We study a method of seed-based lossless filtration for approximate string matching and related bioinformatics applications. The method is based on a simultaneous use of several spaced seeds rather than a single seed as studied by Burkhardt and Kärkkäinen [1]. We present algorithms to compute several important parameters of seed families, study their combinatorial properties, and describe several techniques to construct efficient families. We also report a large-scale application of the proposed technique to the problem of oligonucleotide selection for an EST sequence database.},
keywords = {*imported-from-citeulike-INRMM,~INRMM-MiD:c-1560680,categorical-variables,dynamic-programming,heuristics,similarity},
number = {1}
}
Downloads: 0
{"_id":"N6MkbTn3FXqAXsHtB","bibbaseid":"kucherov-noe-roytberg-multiseedlosslessfiltration","authorIDs":[],"author_short":["Kucherov, G.","Noe, L.","Roytberg, M."],"bibdata":{"bibtype":"article","type":"article","title":"Multiseed Lossless Filtration","author":[{"propositions":[],"lastnames":["Kucherov"],"firstnames":["G."],"suffixes":[]},{"propositions":[],"lastnames":["Noe"],"firstnames":["L."],"suffixes":[]},{"propositions":[],"lastnames":["Roytberg"],"firstnames":["M."],"suffixes":[]}],"date":"2005-01","journaltitle":"Computational Biology and Bioinformatics, IEEE/ACM Transactions on","volume":"2","pages":"51–61","issn":"1545-5963","doi":"10.1109/tcbb.2005.12","url":"https://doi.org/10.1109/tcbb.2005.12","abstract":"We study a method of seed-based lossless filtration for approximate string matching and related bioinformatics applications. The method is based on a simultaneous use of several spaced seeds rather than a single seed as studied by Burkhardt and Kärkkäinen [1]. We present algorithms to compute several important parameters of seed families, study their combinatorial properties, and describe several techniques to construct efficient families. We also report a large-scale application of the proposed technique to the problem of oligonucleotide selection for an EST sequence database.","keywords":"*imported-from-citeulike-INRMM,~INRMM-MiD:c-1560680,categorical-variables,dynamic-programming,heuristics,similarity","number":"1","bibtex":"@article{kucherovMultiseedLosslessFiltration2005,\n title = {Multiseed Lossless Filtration},\n author = {Kucherov, G. and Noe, L. and Roytberg, M.},\n date = {2005-01},\n journaltitle = {Computational Biology and Bioinformatics, IEEE/ACM Transactions on},\n volume = {2},\n pages = {51--61},\n issn = {1545-5963},\n doi = {10.1109/tcbb.2005.12},\n url = {https://doi.org/10.1109/tcbb.2005.12},\n abstract = {We study a method of seed-based lossless filtration for approximate string matching and related bioinformatics applications. The method is based on a simultaneous use of several spaced seeds rather than a single seed as studied by Burkhardt and Kärkkäinen [1]. We present algorithms to compute several important parameters of seed families, study their combinatorial properties, and describe several techniques to construct efficient families. We also report a large-scale application of the proposed technique to the problem of oligonucleotide selection for an EST sequence database.},\n keywords = {*imported-from-citeulike-INRMM,~INRMM-MiD:c-1560680,categorical-variables,dynamic-programming,heuristics,similarity},\n number = {1}\n}\n\n","author_short":["Kucherov, G.","Noe, L.","Roytberg, M."],"key":"kucherovMultiseedLosslessFiltration2005","id":"kucherovMultiseedLosslessFiltration2005","bibbaseid":"kucherov-noe-roytberg-multiseedlosslessfiltration","role":"author","urls":{"Paper":"https://doi.org/10.1109/tcbb.2005.12"},"keyword":["*imported-from-citeulike-INRMM","~INRMM-MiD:c-1560680","categorical-variables","dynamic-programming","heuristics","similarity"],"downloads":0},"bibtype":"article","biburl":"https://tmpfiles.org/dl/58794/INRMM.bib","creationDate":"2020-07-02T22:41:11.646Z","downloads":0,"keywords":["*imported-from-citeulike-inrmm","~inrmm-mid:c-1560680","categorical-variables","dynamic-programming","heuristics","similarity"],"search_terms":["multiseed","lossless","filtration","kucherov","noe","roytberg"],"title":"Multiseed Lossless Filtration","year":null,"dataSources":["DXuKbcZTirdigFKPF"]}