{"title":"Generalized Gapped k-mer Filters for Robust Frequency Estimation","authors":"Morteza Mohammad-Noori, Narges Ghareghani, Mahmoud Ghandi","doi":"10.1007/s41980-024-00901-z","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we study the generalized gapped <i>k</i>-mer filters and derive a closed form solution for their coefficients. We consider nonnegative integers <span>\\(\\ell \\)</span> and <i>k</i>, with <span>\\(k\\le \\ell \\)</span>, and an <span>\\(\\ell \\)</span>-tuple <span>\\(B=(b_1,\\ldots ,b_{\\ell })\\)</span> of integers <span>\\(b_i\\ge 2\\)</span>, <span>\\(i=1,\\ldots ,\\ell \\)</span>. We introduce and study an incidence matrix <span>\\(A=A_{\\ell ,k;B}\\)</span>. We develop a Möbius-like function <span>\\(\\nu _B\\)</span> which helps us to obtain closed forms for a complete set of mutually orthogonal eigenvectors of <span>\\(A^{\\top } A\\)</span> as well as a complete set of mutually orthogonal eigenvectors of <span>\\(AA^{\\top }\\)</span> corresponding to nonzero eigenvalues. The reduced singular value decomposition of <i>A</i> and combinatorial interpretations for the nullity and rank of <i>A</i>, are among the consequences of this approach. We then combine the obtained formulas, some results from linear algebra, and combinatorial identities of elementary symmetric functions and <span>\\(\\nu _B\\)</span>, to provide the entries of the Moore–Penrose pseudo-inverse matrix <span>\\(A^{+}\\)</span> and the Gapped <i>k</i>-mer filter matrix <span>\\(A^{+} A\\)</span>.</p>","PeriodicalId":9395,"journal":{"name":"Bulletin of The Iranian Mathematical Society","volume":"27 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of The Iranian Mathematical Society","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s41980-024-00901-z","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we study the generalized gapped k-mer filters and derive a closed form solution for their coefficients. We consider nonnegative integers \(\ell \) and k, with \(k\le \ell \), and an \(\ell \)-tuple \(B=(b_1,\ldots ,b_{\ell })\) of integers \(b_i\ge 2\), \(i=1,\ldots ,\ell \). We introduce and study an incidence matrix \(A=A_{\ell ,k;B}\). We develop a Möbius-like function \(\nu _B\) which helps us to obtain closed forms for a complete set of mutually orthogonal eigenvectors of \(A^{\top } A\) as well as a complete set of mutually orthogonal eigenvectors of \(AA^{\top }\) corresponding to nonzero eigenvalues. The reduced singular value decomposition of A and combinatorial interpretations for the nullity and rank of A, are among the consequences of this approach. We then combine the obtained formulas, some results from linear algebra, and combinatorial identities of elementary symmetric functions and \(\nu _B\), to provide the entries of the Moore–Penrose pseudo-inverse matrix \(A^{+}\) and the Gapped k-mer filter matrix \(A^{+} A\).
期刊介绍:
The Bulletin of the Iranian Mathematical Society (BIMS) publishes original research papers as well as survey articles on a variety of hot topics from distinguished mathematicians. Research papers presented comprise of innovative contributions while expository survey articles feature important results that appeal to a broad audience. Articles are expected to address active research topics and are required to cite existing (including recent) relevant literature appropriately. Papers are critically reviewed on the basis of quality in its exposition, brevity, potential applications, motivation, value and originality of the results. The BIMS takes a high standard policy against any type plagiarism. The editorial board is devoted to solicit expert referees for a fast and unbiased review process.