#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2003

2015

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- C Geoffrey Woods, James J. 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)

- Mohiuddin Ahmed, Abu Ali Ibn 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
- Int. J. Comput. Geometry Appl.
- 2011

- 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)

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

The string matching problem that appears in many applications like word processing, information retrieval, bibliographic search, molecular biology, etc., consists in finding the first or all the occurrences of a pattern in a text, where the pattern and the text are strings over the same alphabet. Many algorithms for solving this problem exist in literature… (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, Anna Lubiw, Anil Maheshwari
- WALCOM
- 2009

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. We introduce a generalization of the shortest descending path problem, called the shortest gently descending path (SGDP) problem, where a path descends, but not too steeply. The additional constraint to disallow a… (More)

- Mustaq Ahmed, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy
- J. Discrete Algorithms
- 2011