Skip to Content

Algorithms, Volume 6, Issue 3

2013 September - 14 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 (14)

  • Article
  • Open Access
7,473 Views
26 Pages

17 September 2013

In this paper, we present a method to provide proactive assistance in text checking, based on usage relationships between words structuralized on the Web. For a given sentence, the method builds a connectionist structure of relationships between word...

  • Article
  • Open Access
14 Citations
7,695 Views
19 Pages

Quantitative Trait Loci Mapping Problem: An Extinction-Based Multi-Objective Evolutionary Algorithm Approach

  • Ahmadreza Ghaffarizadeh,
  • Mehdi Eftekhari,
  • Ali K. Esmailizadeh and
  • Nicholas S. Flann

2 September 2013

The Quantitative Trait Loci (QTL) mapping problem aims to identify regions in the genome that are linked to phenotypic features of the developed organism that vary in degree. It is a principle step in determining targets for further genetic analysis...

  • Article
  • Open Access
24 Citations
11,359 Views
20 Pages

Extraction and Segmentation of Sputum Cells for Lung Cancer Early Diagnosis

  • Fatma Taher,
  • Naoufel Werghi,
  • Hussain Al-Ahmad and
  • Christian Donner

21 August 2013

Lung cancer has been the largest cause of cancer deaths worldwide with an overall 5-year survival rate of only 15%. Its symptoms can be found exclusively in advanced stages where the chances for patients to survive are very low, thus making the morta...

(This article belongs to the Section Evolutionary Algorithms and Machine Learning)
  • Article
  • Open Access
5 Citations
8,425 Views
14 Pages

Stable Flows over Time

  • Ágnes Cseh,
  • Jannik Matuschke and
  • Martin Skutella

21 August 2013

In this paper, the notion of stability is extended to network flows over time. As a useful device in our proofs, we present an elegant preflow-push variant of the Gale-Shapley algorithm that operates directly on the given network and computes stable...

(This article belongs to the Special Issue Special Issue on Matching under Preferences)
  • Article
  • Open Access
14 Citations
10,860 Views
17 Pages

An Algorithm for Managing Aircraft Movement on an Airport Surface

  • Urbano Tancredi,
  • Domenico Accardo,
  • Giancarmine Fasano,
  • Alfredo Renga,
  • Giancarlo Rufino and
  • Giuseppe Maresca

16 August 2013

The present paper focuses on the development of an algorithm for safely and optimally managing the routing of aircraft on an airport surface in future airport operations. This tool is intended to support air traffic controllers’ decision-making in se...

  • Article
  • Open Access
53 Citations
10,004 Views
14 Pages

15 August 2013

We consider a two-sided market under incomplete preference lists with ties, where the goal is to find a maximum size stable matching. The problem is APX-hard, and a 3/2-approximation was given by McDermid [1]. This algorithm has a non-linear running...

(This article belongs to the Special Issue Special Issue on Matching under Preferences)
  • Article
  • Open Access
7 Citations
6,963 Views
9 Pages

15 August 2013

This paper studies the string-excluding (STR-EC)-constrained longest common subsequence (LCS) problem, a generalized LCS problem. For the two input sequences, X and Y , of lengths n andmand a constraint string, P, of length r, the goal is to find the...

  • Article
  • Open Access
3 Citations
6,327 Views
12 Pages

12 August 2013

Nowadays, due to the concern regarding environmental issues, establishing pedestrian/bike friendly urbanism is widely encouraged. To promote safety-assured, mobile communication environments, efficient, reliable maintenance, and information integrity...

  • Review
  • Open Access
8 Citations
8,279 Views
15 Pages

6 August 2013

A survey on the routing protocols based on ant-like mobile agents is given. These protocols are often employed in Mobile Ad Hoc Networks (MANET). Mobile Ad Hoc Networks are collections of wireless mobile nodes such as PDAs, laptop computers, and cel...

(This article belongs to the Special Issue Bio-inspired Algorithms for Combinatorial Problems)
  • Article
  • Open Access
5 Citations
8,802 Views
12 Pages

Efficient in silico Chromosomal Representation of Populations via Indexing Ancestral Genomes

  • Niina Haiminen,
  • Filippo Utro,
  • Claude Lebreton,
  • Pascal Flament,
  • Zivan Karaman and
  • Laxmi Parida

30 July 2013

One of the major challenges in handling realistic forward simulations for plant and animal breeding is the sheer number of markers. Due to advancing technologies, the requirement has quickly grown from hundreds of markers to millions. Most simulators...

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

19 July 2013

A novel noise filtering algorithm based on averaging Intrinsic Mode Function (aIMF), which is a derivation of Empirical Mode Decomposition (EMD), is proposed to remove white-Gaussian noise of foreign currency exchange rates that are nonlinear nonstat...

  • Article
  • Open Access
8 Citations
7,357 Views
11 Pages

New Heuristics for Rooted Triplet Consistency

  • Soheil Jahangiri,
  • Seyed Naser Hashemi and
  • Hadi Poormohammadi

11 July 2013

Rooted triplets are becoming one of the most important types of input for reconstructing rooted phylogenies. A rooted triplet is a phylogenetic tree on three leaves and shows the evolutionary relationship of the corresponding three species. In this p...

(This article belongs to the Special Issue Graph Algorithms)
  • Article
  • Open Access
5 Citations
8,037 Views
13 Pages

Maximum Locally Stable Matchings

  • Christine T. Cheng and
  • Eric McDermid

24 June 2013

Motivated by the observation that most companies are more likely to consider job applicants referred by their employees than those who applied on their own, Arcaute and Vassilvitskii modeled a job market that integrates social networks into stable ma...

(This article belongs to the Special Issue Special Issue on Matching under Preferences)
XFacebookLinkedIn
Algorithms - ISSN 1999-4893