#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2003

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- C Geoffrey Woods, James Cox, +12 authors Chris F Inglehearn
- American journal of human genetics
- 2006

Individuals born of consanguineous union have segments of their genomes that are homozygous as a result of inheriting identical ancestral genomic segments through both parents. One consequence of this is an increased incidence of recessive disease within these sibships. Theoretical calculations predict that 6% (1/16) of the genome of a child of first… (More)

- Mustaq Ahmed, Anna Lubiw
- Int. J. Comput. Geometry Appl.
- 2011

- Mohiuddin Ahmed, Abu Sina, Md. Raju Chowdhury, Mustaq Ahmed, Md. Mahmudul Hasan Rafee
- 2012

Cloud Computing is considered as one of the emerging arenas of computer science in recent times. It is providing excellent facilities to business entrepreneurs by flexible infrastructure. Although, cloud computing is facilitating the Information Technology industry, the research and development in this arena is yet to be satisfactory. Our contribution in… (More)

- Mustaq Ahmed, Anna Lubiw
- CCCG
- 2006

A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to find a shortest descending path from s to t in a polyhedral terrain. We give some properties of such paths. In the case where the face sequence is specified, we show that the… (More)

- Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy
- J. Discrete Algorithms
- 2010

A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to find a shortest descending path (SDP) from s to t in a polyhedral terrain. We give two approximation algorithms (more precisely, FPTASs) that solve the SDP problem on general… (More)

- Mustaq Ahmed, Anna Lubiw
- ArXiv
- 2007

A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to find a shortest descending path (SDP) from s to t in a polyhedral terrain. We give a simple approximation algorithm that solves the SDP problem on general terrains. Our algorithm… (More)

- Mustaq Ahmed, Mohammad Kaykobad, Rezaul Alam Chowdhury
- Int. J. Comput. Math.
- 2003

In this paper a new exact string-matching algorithm with sub-linear average case complexity has been presented. Unlike other sub-linear string-matching algorithms it never performs more than n text character comparisons while working on a text of length n. It requires only O(m þ s) extra pre-processing time and space, where m is the length of the pattern… (More)

- Mustaq Ahmed, Anna Lubiw
- 2007

A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to find an exact shortest descending path (SDP) from s to t in a general poly-hedral terrain, although approximation algorithms for general terrains [2, 6] and exact algorithms for… (More)

- Mustaq Ahmed, Anna Lubiw
- 2008

In the shortest anisotropic path (SAP) problem [7], the goal is to minimize the weighted length of a path on a triangulated terrain, where the weight of a path segment ab depends both on the face containing ab and the direction of ab. The problem is a generalization of the weighted region problem. Several papers [3, 5, 8, 9] give approximation algorithms… (More)

- Mustaq Ahmed, Anna Lubiw
- Networks
- 2009

In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest s-t path P such that no path in X is a subpath of P. Path P is allowed to repeat vertices and edges. We call each path in X an exception, and our desired path a shortest exception… (More)