Zobrazeno 1 - 10
of 9 363
pro vyhledávání: '"LaFond A"'
In the Cluster Editing problem, sometimes known as (unweighted) Correlation Clustering, we must insert and delete a minimum number of edges to achieve a graph in which every connected component is a clique. Owing to its applications in computational
Externí odkaz:
http://arxiv.org/abs/2412.12454
Autor:
Lafond, Manuel
Given a bipartite graph $G$, the \textsc{Bicluster Editing} problem asks for the minimum number of edges to insert or delete in $G$ so that every connected component is a bicluster, i.e. a complete bipartite graph. This has several applications, incl
Externí odkaz:
http://arxiv.org/abs/2410.13123
Autor:
Wiese, Samuel, Kaszowska-Mojsa, Jagoda, Dyer, Joel, Moran, Jose, Pangallo, Marco, Lafond, Francois, Muellbauer, John, Calinescu, Anisoara, Farmer, J. Doyne
In the last few years, economic agent-based models have made the transition from qualitative models calibrated to match stylised facts to quantitative models for time series forecasting, and in some cases, their predictions have performed as well or
Externí odkaz:
http://arxiv.org/abs/2409.18760
Autor:
Sánchez, Alitzel López, Lafond, Manuel
Predicting horizontal gene transfers often requires comparative sequence data, but recent work has shown that character-based approaches could also be useful for this task. Notably, perfect transfer networks (PTN) explain the character diversity of a
Externí odkaz:
http://arxiv.org/abs/2409.03935
Autor:
Rancurel, Belén Alonso, Cao, Son, Carroll, Thomas J., Castellan, Rhys, Catano-Mur, Erika, Cesar, John P., Coelho, João A. B., Dills, Patrick, Dodwell, Thomas, Edmondson, Jack, van Eijk, Daan, Fetterly, Quinn, Garbal, Zoé, Germani, Stefano, Gilpin, Thomas, Giraudo, Anthony, Habig, Alec, Hanuska, Daniel, Hausner, Harry, Hernandez, Wilson Y., Holin, Anna, Huang, Junting, Jones, Sebastian B., Karle, Albrecht, Kileff, George, Jenkins, Kai R., Kooijman, Paul, Kreymer, Arthur, LaFond, Gabe M., Lang, Karol, Lazar, Jeffrey P., Li, Rui, Liu, Kexin, Loving, David A., Mánek, Petr, Marshak, Marvin L., Meier, Jerry R., Miller, William, Nelson, Jeffrey K., Ng, Christopher, Nichol, Ryan J., Paolone, Vittorio, Perch, Andrew, Pfützner, Maciej M., Radovic, Alexander, Rawlins, Katherine, Roedl, Patrick, Rogers, Lucas, Safa, Ibrahim, Sousa, Alexandre, Tingey, Josh, Thomas, Jennifer, Trokan-Tenorio, Jozef, Vahle, Patricia, Wade, Richard, Wendt, Christopher, Wendt, Daniel, Whitehead, Leigh H., Wolcott, Samuel, Yuan, Tianlu
The CHIPS R&D project focuses on development of low-cost water Cherenkov neutrino detectors through novel design strategies and resourceful engineering. This work presents an end-to-end DAQ solution intended for a recent 5 kt CHIPS prototype, which i
Externí odkaz:
http://arxiv.org/abs/2408.10828
Autor:
Lafond, Manuel, Moulton, Vincent
In phylogenetics, evolution is traditionally represented in a tree-like manner. However, phylogenetic networks can be more appropriate for representing evolutionary events such as hybridization, horizontal gene transfer, and others. In particular, th
Externí odkaz:
http://arxiv.org/abs/2408.06489
Autor:
Sánchez, Alitzel López, Ramírez-Rafael, José Antonio, Flores-Lamas, Alejandro, Hernández-Rosales, Maribel, Lafond, Manuel
In this study, we investigate the problem of comparing gene trees reconciled with the same species tree using a novel semi-metric, called the Path-Label Reconciliation (PLR) dissimilarity measure. This approach not only quantifies differences in the
Externí odkaz:
http://arxiv.org/abs/2407.06367
A graph $G=(V,E)$ is a $k$-leaf power if there is a tree $T$ whose leaves are the vertices of $G$ with the property that a pair of leaves $u$ and $v$ induce an edge in $G$ if and only if they are distance at most $k$ apart in $T$. For $k\le 4$, it is
Externí odkaz:
http://arxiv.org/abs/2407.02412
In this paper, we lay the groundwork on the comparison of phylogenetic networks based on edge contractions and expansions as edit operations, as originally proposed by Robinson and Foulds to compare trees. We prove that these operations connect the s
Externí odkaz:
http://arxiv.org/abs/2405.16713
Motivation: Non-coding RNAs (ncRNAs) express their functions by adopting molecular structures. Specifically, RNA secondary structures serve as a relatively stable intermediate step before tertiary structures, offering a reliable signature of molecula
Externí odkaz:
http://arxiv.org/abs/2402.03455