19 papers · ranked by Valyu relevance
Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
'Alexandru I. Tomescu'] Minimum flow decomposition (MFD) — the problem of finding a minimum set of weighted source-to-sink paths that perfectly decomposes a flow — is a classical problem in Computer Science, and variants of it are powerful models in a different fields such as Bioinformatics and Transportation. Even on…
Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
'Alexandru I. Tomescu'] Abstract. Minimum flow decomposition (MFD) — the problem of finding a minimum set of paths that perfectly decomposes a flow — is a classical problem in Computer Science, and variants of it are powerful models in multiassembly problems in Bioinformatics (e.g. RNA assembly). However, because this…
Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
Minimum flow decomposition (MFD) - the problem of finding a minimum set of weighted source-to-sink paths that perfectly decomposes a flow - is a classical problem in Computer Science, and variants of it are powerful models in a different fields such as Bioinformatics and Transportation. Even on acyclic graphs, the…
Fernando H.C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
'Alexandru I. Tomescu'] Minimum flow decomposition (MFD) is an NP-hard problem asking to decompose a network flow into a minimum set of paths (together with associated weights). Variants of it are powerful models in multiassembly problems in Bioinformatics, such as RNA assembly. Owing to its hardness, practical…
Ke Chen, Abhishek Talesara, Sanchal Thakkar, Mingfu Shao
The minimum flow decomposition problem abstracts a set of key tasks in bioinformatics, including metagenome and transcriptome assembly. These tasks, collectively known as multi-assembly, aim to reconstruct multiple genomic sequences from reads obtained from mixed samples. The reads are first organized into a directed…
Lukas Graf, Tobias Harks, Julian Schwarz
The famous edge flow decomposition theorem of Gallai [12] states that any static edge s,d-flow in a directed graph can be decomposed into a linear combination of incidence vectors of paths and cycles. In this paper, we study the decomposition problem for the setting of dynamic edge s,d-flows assuming a quite general…
Yue Zhang, Ruoyu Huang, Wiebke Nörenberg, Aristides B. Arrenberg
The perception of optic flow is essential for any visually guided behaviour of a moving animal. To mechanistically predict behaviour and understand the emergence of self-motion perception in vertebrate brains, it is essential to systematically characterize the motion receptive fields (RFs) of optic flow processing…
Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams + 1 more
'Alexandru I. Tomescu'] Decomposing a network flow into weighted paths is a problem with numerous applications, ranging from networking, transportation planning, to bioinformatics. In some applications we look for a decomposition that is optimal with respect to some property, such as the number of paths used…
Ke Chen, Abhishek Talesara, Sanchal Thakkar, Mingfu Shao
The minimum flow decomposition problem abstracts a set of key tasks in bioinformatics, including metagenome and transcriptome assembly. These tasks, collectively known as multi-assembly, aim to reconstruct multiple genomic sequences from reads obtained from mixed samples. The reads are first organized into a directed…
Fernando H. C. Dias, Alexandru I. Tomescu
Minimum flow decomposition (MFD) is a common problem across various fields of Computer Science, where a flow is decomposed into a minimum set of weighted paths. However, in Bioinformatics applications, such as RNA transcript or quasi-species assembly, the flow is erroneous, since is obtained from noisy read coverages.…
Francisco Sena, Eliel Ingervo, Shahbaz Khan, Andrey Prjibelski + 2 more
A decomposition of a network flow is a set of weighted paths whose superposition equals the flow. The problem of characterising and computing safe walks for flow decompositions has so far seen only a partial solution by restricting the flow decomposition to consist of paths, and the graph to be directed and acyclic…
Tobias Wand, Oliver Kamps, Hiroshi Iyetomi, Brian Lucey + 3 more
'Shupei Huang' 'Xueyong Liu' 'Xinya Wang'] Granger causality can uncover the cause-and-effect relationships in financial networks. However, such networks can be convoluted and difficult to interpret, but the Helmholtz-Hodge-Kodaira decomposition can split them into rotational and gradient components which reveal the…
Suryansh Prakhar, Jung-Hee Seo, Rajat Mittal
Loads for Decomposed Flow Modes with Application to Aeroacoustic Noise Authors: ['Suryansh Prakhar' 'Jung-Hee Seo' 'Rajat Mittal'] Aerodynamic loads play a central role in many fluid dynamics applications, and we present a method for identifying the structures (or modes) in a flow that make dominant contributions to…
Chotirawee Chatpattanasiri, Gaia Franzetti, Mirko Bonfanti, Vanessa Diaz-Zuccarini + 1 more
Data driven, reduced order modelling has shown promise in tackling the challenges associated with computational and experimental hemodynamic models. In this work, we explore the use of Reduced Order Models (ROMs) to capture the main flow features in a patient-specific dissected aorta. We apply Proper Orthogonal…
Jiawei Chen, Han Gao, Ping He
Uncovering the physical mechanisms of turbulent flows remains a fundamental challenge in fluid mechanics. In particular, conventional velocity-gradient analysis methods suffer from shear contamination, which hinders accurate identification of the dominant physical mechanisms. This study presents PhysMiner, an automated…
Authors not listed
Self-driving laboratories (SDLs) promise accelerated scientific discovery and product development by closing the loop between robotic execution and AI/ML-driven decision making. In practice, however, SDL orchestration remains fragmented; workflows are typically encoded as laboratory-specific scripts or bespoke…
Meisam Bahari, Yan Jing, Shijian Jin, Marc-Antoni Goulet + 3 more
We study the capacity fade rate of a flow battery utilizing 2,6-dihydroxyanthraquinone (DHAQ) and its dependence on hydroxide concentration, state of charge, cutoff voltages for the discharge step and for the electrochemical regeneration (oxidation of decomposition compounds back to active species) step, and period of…
Giane Damas, Karl Rönnby, Henrik Pedersen, Lars Ojamäe
Indium nitride (InN) is an interesting material for future electronic and photonic-related applications, as it combines high electron mobility and low-energy band gap for photoabsorption or emission-driven processes. In this context, atomic layer deposition (ALD) techniques have been previously employed for InN growth…
Authors not listed
In this paper we continue our previous investigation about the use of stress function in the flow of generalized Newtonian fluids through conduits of circular and non-circular (or/and multiply connected) cross sections where we inspect the flow of power law fluids in tubes of elliptical cross sections. We derive…