Skip to Content

Algorithms, Volume 6, Issue 2

2013 June - 8 articles

  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list .
  • You may sign up for email alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.

Articles (8)

  • Article
  • Open Access
4 Citations
9,889 Views
12 Pages

Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists

  • Takao Inoshita,
  • Robert W. Irving,
  • Kazuo Iwama,
  • Shuichi Miyazaki and
  • Takashi Nagase

28 May 2013

In the stable marriage problem, any instance admits the so-called man-optimal stable matching, in which every man is assigned the best possible partner. However, there are instances for which all men receive low-ranked partners even in the man-optima...

(This article belongs to the Special Issue Special Issue on Matching under Preferences)
  • Article
  • Open Access
4 Citations
7,345 Views
19 Pages

22 May 2013

In biology, the notion of degenerate pattern plays a central role for describing various phenomena. For example, protein active site patterns, like those contained in the PROSITE database, e.g., [FY ]DPC[LIM][ASG]C[ASG], are, in general, represented...

(This article belongs to the Special Issue Algorithms for Sequence Analysis and Storage)
  • Article
  • Open Access
23 Citations
11,097 Views
31 Pages

21 May 2013

In this contribution, a generic two-phase stochastic variable neighborhood approach is applied to nurse rostering problems. The proposed algorithm is used for creating feasible and efficient nurse rosters for many different nurse rostering cases. In...

  • Article
  • Open Access
2 Citations
7,629 Views
10 Pages

21 May 2013

Data storage is a major and growing part of IT budgets for research since manyyears. Especially in biology, the amount of raw data products is growing continuously,and the advent of the so-called "next-generation" sequencers has made things worse.Aff...

(This article belongs to the Special Issue Algorithms for Sequence Analysis and Storage)
  • Article
  • Open Access
26 Citations
10,450 Views
33 Pages

Practical Compressed Suffix Trees

  • Andrés Abeliuk,
  • Rodrigo Cánovas and
  • Gonzalo Navarro

21 May 2013

The suffix tree is an extremely important data structure in bioinformatics. Classical implementations require much space, which renders them useless to handle large sequence collections. Recent research has obtained various compressed representations...

(This article belongs to the Special Issue Algorithms for Sequence Analysis and Storage)
  • Article
  • Open Access
12 Citations
10,207 Views
33 Pages

Fast Rescheduling of Multiple Workflows to Constrained Heterogeneous Resources Using Multi-Criteria Memetic Computing

  • Wilfried Jakob,
  • Sylvia Strack,
  • Alexander Quinte,
  • Günther Bengel and ,
  • Karl-Uwe Stucky and
  • Wolfgang Süß
  • + 1 author+ 0 author

22 April 2013

This paper is motivated by, but not limited to, the task of scheduling jobs organized in workflows to a computational grid. Due to the dynamic nature of grid computing, more or less permanent replanning is required so that only very limited time is a...

  • Article
  • Open Access
55 Citations
15,461 Views
18 Pages

19 April 2013

Course timetabling is a combinatorial optimization problem and has been confirmed to be an NP-complete problem. Course timetabling problems are different for different universities. The studied university course timetabling problem involves hard cons...

  • Article
  • Open Access
93 Citations
15,189 Views
30 Pages

2 April 2013

The Internet of Things (IoT) refers to the Internet-like structure of billions of interconnected constrained devices, denoted as “smart objects”. Smart objects have limited capabilities, in terms of computational power and memory, and might be batter...

XFacebookLinkedIn
Algorithms - ISSN 1999-4893