Papers published on a yearly basis
Papers
More filters
••
TL;DR: A thorough analysis of the alignment hierarchy is provided, including a new polynomial-time algorithm and an NP-completeness proof, which gives rise to edit models that have not been studied yet.
Abstract: We describe a theoretical unifying framework to express the comparison of RNA structures, which we call alignment hierarchy. This framework relies on the definition of common supersequences for arc-annotated sequences and encompasses the main existing models for RNA structure comparison based on trees and arc-annotated sequences with a variety of edit operations. It also gives rise to edit models that have not been studied yet. We provide a thorough analysis of the alignment hierarchy, including a new polynomial-time algorithm and an NP-completeness proof. The polynomial-time algorithm involves biologically relevant edit operations such as pairing or unpairing nucleotides. It has been implemented in a software, called gardenia, which is available at the Web server http://bioinfo.lifl.fr/RNA/gardenia.
48 citations
••
TL;DR: A special case of Willems's two-user multiaccess channel with partially cooperating encoders from a security perspective, which establishes inner and outer bounds on the capacity-equivocation region and shows that these bounds agree in some extreme cases of cooperation between theencoders.
Abstract: We study a special case of Willems's two-user multiaccess channel with partially cooperating encoders from a security perspective. This model differs from Willems's setup in that only one encoder, Encoder 1, is allowed to conference; Encoder 2 does not transmit any message, and there is an additional passive eavesdropper from whom the communication should be kept secret. For the discrete memoryless (DM) case, we establish inner and outer bounds on the capacity-equivocation region. The inner bound is based on a combination of Willems's coding scheme, noise injection, and additional binning that provides randomization for security. For the memoryless Gaussian model, we establish lower and upper bounds on the secrecy capacity. We also show that, under certain conditions, these bounds agree in some extreme cases of cooperation between the encoders. We illustrate our results through some numerical examples.
48 citations
••
48 citations
••
TL;DR: The addition of dodecanol as a co-surfactant in sodium dodecyl sulfate (SDS) solution is known to stabilize the foam in free drainage as mentioned in this paper.
48 citations
••
TL;DR: The main result is to provide a representation theoretical interpretation of the peak algebra and its graded dual as Grothendieck rings of the tower of Hecke-Clifford algebras at q = 0.
48 citations
Authors
Showing all 831 results
Name | H-index | Papers | Citations |
---|---|---|---|
Dapeng Yu | 94 | 745 | 33613 |
Daniel Azoulay | 78 | 510 | 23979 |
Mehmet A. Oturan | 77 | 261 | 22682 |
Alfred O. Hero | 73 | 899 | 29258 |
Nihal Oturan | 64 | 174 | 12092 |
Jean-Christophe Pesquet | 50 | 364 | 13264 |
Eric D. van Hullebusch | 50 | 265 | 9030 |
Christian Soize | 48 | 529 | 9932 |
Maxime Crochemore | 47 | 314 | 9836 |
Jean-Yves Thibon | 42 | 191 | 6398 |
Marie-France Sagot | 41 | 191 | 5972 |
François Farges | 41 | 111 | 6349 |
Laurent Najman | 40 | 233 | 9238 |
Renaud Keriven | 39 | 108 | 6330 |
Robert Eymard | 39 | 171 | 6964 |