Sciweavers

392 search results - page 56 / 79
» Reversal Complexity Revisited
Sort
View
TCS
2011
13 years 3 months ago
An algorithmic framework for network reconstruction
Models of biological systems and phenomena are of high scientific interest and practical relevance, but not always easy to obtain due to their inherent complexity. To gain the re...
Markus Durzinsky, Annegret Wagler, Robert Weismant...
ICASSP
2011
IEEE
13 years 11 days ago
A Bayesian marked point process for object detection. Application to muse hyperspectral data
Marked point processes have received a great attention in the recent years, for their ability to extract objects in large data sets as those obtained in biological studies or hype...
Florent Chatelain, Aude Costard, Olivier J. J. Mic...
SPAA
2009
ACM
14 years 9 months ago
Routing without ordering
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
Bernadette Charron-Bost, Antoine Gaillard, Jennife...
COMPGEOM
2010
ACM
14 years 1 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
BMCBI
2008
71views more  BMCBI 2008»
13 years 8 months ago
A tale of two symmetrical tails: Structural and functional characteristics of palindromes in proteins
Background: It has been previously shown that palindromic sequences are frequently observed in proteins. However, our knowledge about their evolutionary origin and their possible ...
Armita Sheari, Mehdi Kargar, Ali Katanforoush, Sha...