<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>zoe.cgl.bio</title>
    <link>/</link>
    <description>Recent content on zoe.cgl.bio</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Sun, 26 Apr 2026 20:23:34 +0000</lastBuildDate>
    <atom:link href="/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>nmer</title>
      <link>/posts/nmer/</link>
      <pubDate>Sun, 26 Apr 2026 20:23:34 +0000</pubDate>
      <guid>/posts/nmer/</guid>
      <description>&lt;h1 id=&#34;a-constrained-combinatorial-framework-for-efficient-n-mer-analysis-of-microbial-communities&#34;&gt;A Constrained Combinatorial Framework for Efficient N-mer Analysis of Microbial Communities&lt;/h1&gt;&#xA;&lt;p&gt;The analysis of microbial communities often requires examining combinations of&#xA;taxa to capture higher-order relationships. However, the number of possible&#xA;combinations increases rapidly with the number of taxa, making exhaustive enumeration&#xA;computationally impractical. In this work, we present a hybrid N-mer generation&#xA;framework that balances complete enumeration with practical limits on computational&#xA;cost. The approach uses Gray code traversal to efficiently generate combinations,&#xA;enabling full enumeration for samples with moderate numbers of taxa. For larger&#xA;samples, where combinatorial growth is concentrated at intermediate values of &lt;em&gt;k&lt;/em&gt;,&#xA;the method introduces an adaptive cap that is applied only when the number of&#xA;combinations becomes prohibitively large. Within these regions, combinations are&#xA;prioritized using an abundance-based scoring scheme, favoring those supported by&#xA;stronger quantitative signals. This design preserves full coverage of lower-order&#xA;combinations while selectively reducing the number of high-order combinations that&#xA;are often sparse and difficult to interpret. Applied to microbial abundance data, the&#xA;framework maintains representative combinatorial structure while keeping runtime&#xA;manageable. Overall, this work provides a scalable approach for exploring taxa&#xA;combinations and a practical foundation for incorporating N-mer representations into&#xA;downstream analyses.&lt;/p&gt;</description>
    </item>
    <item>
      <title>About me</title>
      <link>/about/</link>
      <pubDate>Sun, 26 Apr 2026 20:06:57 +0000</pubDate>
      <guid>/about/</guid>
      <description>&lt;p&gt;I&amp;rsquo;m Zoe Keihani and this is my site! I&amp;rsquo;m a molecular biologist and data scientist looking for work.&lt;/p&gt;&#xA;&lt;p&gt;You can find me on &lt;a href=&#34;https://github.com/zoekeihani&#34;&gt;GitHub&lt;/a&gt;, &lt;a href=&#34;https://www.linkedin.com/in/zoe-keihani&#34;&gt;LinkedIn&lt;/a&gt; or read my resume &lt;a href=&#34;/files/ResumeZK-2026.pdf&#34;&gt;here&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;If you&amp;rsquo;re an ASU professor looking for my most recent work, you can find it &lt;a href=&#34;https://github.com/zoekeihani/nmer_cpu_asu&#34;&gt;here&lt;/a&gt;.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
