Search Results - "Bulteau, Laurent"

Consensus Strings with Small Maximum Distance and Small Distance Sum by Bulteau, Laurent, Schmid, Markus L.

“…The parameterised complexity of various consensus string problems ( Closest String , Closest Substring , Closest String with Outliers ) is investigated in a…”
Get full text

Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics by Marchand, Bertrand, Ponty, Yann, Bulteau, Laurent

“…Hard graph problems are ubiquitous in Bioinformatics, inspiring the design of specialized Fixed-Parameter Tractable algorithms, many of which rely on a…”
Get full text

Automated design of dynamic programming schemes for RNA folding with pseudoknots by Marchand, Bertrand, Will, Sebastian, Berkemer, Sarah J., Ponty, Yann, Bulteau, Laurent

“…Abstract Although RNA secondary structure prediction is a textbook application of dynamic programming (DP) and routine task in RNA structure analysis, it…”
Get full text

Justified Representation for Perpetual Voting by Bulteau, Laurent, Hazon, Noam, Page, Rutvik, Rosenfeld, Ariel, Talmon, Nimrod

“…We study the social choice setting of perpetual voting where, based on voter preferences, decisions have to be taken over a finite horizon of consecutive…”
Get full text

Sorting by Multi-Cut Rearrangements by Bulteau, Laurent, Fertin, Guillaume, Jean, Géraldine, Komusiewicz, Christian

“…A multi-cut rearrangement of a string S is a string S′ obtained from S by an operation called k-cut rearrangement, that consists of (1) cutting S at a given…”
Get full text

Co-Clustering under the Maximum Norm by Bulteau, Laurent, Froese, Vincent, Hartung, Sepp, Niedermeier, Rolf

“…Co-clustering, that is partitioning a numerical matrix into " homogeneous " submatrices, has many applications ranging from bioinformatics to election…”
Get full text

The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings by Bulteau, Laurent, Zhang, Louxin

“…One strategy for inference of phylogenetic networks is to solve the phylogenetic network problem, which involves inferring phylogenetic trees first and…”
Get full text

Parameterized Algorithms in Bioinformatics: An Overview by Bulteau, Laurent, Weller, Mathias

“…Bioinformatics regularly poses new challenges to algorithm engineers and theoretical computer scientists. This work surveys recent developments of…”
Get full text

Genome rearrangements with indels in intergenes restrict the scenario space by Bulteau, Laurent, Fertin, Guillaume, Tannier, Eric

“…Given two genomes that have diverged by a series of rearrangements, we infer minimum Double Cut-and-Join (DCJ) scenarios to explain their organization…”
Get full text

On shuffled-square-free words by Bulteau, Laurent, Jugé, Vincent, Vialette, Stéphane

“…A word u is a shuffle of words v and w, which we denote by u∈v⧢w, if u can be obtained by mixing the letters from v and w in a way that preserves the…”
Get full text

Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation by Bulteau, Laurent, Shahaf, Gal, Shapiro, Ehud, Talmon, Nimrod

“…We present a unifying framework encompassing a plethora of social choice settings. Viewing each social choice setting as voting in a suitable metric space, we…”
Get full text

Pancake Flipping is hard by Bulteau, Laurent, Fertin, Guillaume, Rusu, Irena

“…Pancake Flipping is the problem of sorting a stack of pancakes of different sizes (that is, a permutation), when the only allowed operation is to insert a…”
Get full text

Your rugby mates don't need to know your colleagues: Triadic closure with edge colors by Bulteau, Laurent, Grüttemeier, Niels, Komusiewicz, Christian, Sorge, Manuel

“…Given an undirected graph G=(V,E) the NP-hard Strong Triadic Closure (STC) problem asks for a labeling of the edges as weak and strong such that at most k…”
Get full text

Triangle Counting in Dynamic Graph Streams by Bulteau, Laurent, Froese, Vincent, Kutzkov, Konstantin, Pagh, Rasmus

“…Estimating the number of triangles in graph streams using a limited amount of memory has become a popular topic in the last decade. Different variations of the…”
Get full text

Fixed-parameter algorithms for scaffold filling by Bulteau, Laurent, Carrieri, Anna Paola, Dondi, Riccardo

“…The new sequencing technologies, called next-generation sequencing, provide a huge amount of data that can be used to reconstruct genomes. However, the methods…”
Get full text

Decomposing subcubic graphs into claws, paths or triangles by Bulteau, Laurent, Fertin, Guillaume, Labarre, Anthony, Rizzi, Romeo, Rusu, Irena

“…Let S = { K 1 , 3 , K 3 , P 4 } be the set of connected graphs of size 3. We study the problem of partitioning the edge set of a graph G into graphs taken from…”
Get full text

Combinatorial voter control in elections by Bulteau, Laurent, Chen, Jiehua, Faliszewski, Piotr, Niedermeier, Rolf, Talmon, Nimrod

“…Voter control problems model situations such as an external agent trying to affect the result of an election by adding voters, for example by convincing some…”
Get full text

Efficient, robust and effective rank aggregation for massive biological datasets by Andrieu, Pierre, Brancotte, Bryan, Bulteau, Laurent, Cohen-Boulakia, Sarah, Denise, Alain, Pierrot, Adeline, Vialette, Stéphane

“…Massive biological datasets are available in various sources. To answer a biological question (e.g., “which are the genes involved in a given disease?”), life…”
Get full text

Sorting Signed Permutations by Intergenic Reversals by Oliveira, Andre Rodrigues, Jean, Geraldine, Fertin, Guillaume, Brito, Klairton Lima, Bulteau, Laurent, Dias, Ulisses, Dias, Zanoni

“…Genome rearrangements are mutations affecting large portions of a genome, and a reversal is one of the most studied genome rearrangements in the literature…”
Get full text

Multi-Player Diffusion Games on Graph Classes by Bulteau, Laurent, Froese, Vincent, Talmon, Nimrod

“…We study competitive diffusion games on graphs introduced by Alon et al. [ 1 ] to model the spread of influence in social networks. Extending results of…”
Get full text