377 search results - page 1 / 76 » A Fast Heuristic Algorithm for a Probe Mapping Problem |
ISMB
1997
13 years 6 months ago
1997
Anewheuristic algorithm is presented for mapping probes to locations along the genome,given noisy pairwise distance data as input. Themodel consideredis quite general: Theinput co...
CSB
2003
IEEE
13 years 10 months ago
2003
IEEE
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...
CSB
2005
IEEE
13 years 6 months ago
2005
IEEE
Genome sequencing opened a new era in genetics allowing the study of genomes at the nucleotide level. However, the chosen method of sequencing produced large numbers of nucleotide...
BMCBI
2008
13 years 5 months ago
2008
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...