Multiseed Lossless Filtration. Kucherov, G., Noe, L., & Roytberg, M. 2(1):51–61.
Multiseed Lossless Filtration [link]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