|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
22 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | Alignment networks and electrical networks |
Vingron, Martin |
1996 |
71 | 1-3 |
p. 297-309 13 p. |
article |
|
| 2 | Analyzing and visualizing sequence and distance data using SplitsTree |
Dress, A. |
1996 |
71 | 1-3 |
p. 95-109 15 p. |
article |
|
| 3 | Author index |
1996 |
71 | 1-3 |
p. 367-368 2 p. |
article |
||
| 4 | Conserved synteny as a measure of genomic distance |
Sankoff, David |
1996 |
71 | 1-3 |
p. 247-257 11 p. |
article |
|
| 5 | Editorial Board |
1996 |
71 | 1-3 |
p. iii-iv nvt p. |
article |
||
| 6 | Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in E 3 |
Smith, J.MacGregor |
1996 |
71 | 1-3 |
p. 187-215 29 p. |
article |
|
| 7 | Fast multiple alignment of ungapped DNA sequences using information theory and a relaxation method |
Schneider, Thomas D. |
1996 |
71 | 1-3 |
p. 259-268 10 p. |
article |
|
| 8 | Introduction |
1996 |
71 | 1-3 |
p. 1-4 4 p. |
article |
||
| 9 | Local multiple alignment via subgraph enumeration |
Zhang, Z. |
1996 |
71 | 1-3 |
p. 337-365 29 p. |
article |
|
| 10 | Minimizing phylogenetic number to find good evolutionary trees |
Goldberg, Leslie Ann |
1996 |
71 | 1-3 |
p. 111-136 26 p. |
article |
|
| 11 | Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) |
Bafna, Vineet |
1996 |
71 | 1-3 |
p. 41-53 13 p. |
article |
|
| 12 | On intervalizing k-colored graphs for DNA physical mapping |
Bodlaender, Hans L. |
1996 |
71 | 1-3 |
p. 55-77 23 p. |
article |
|
| 13 | On Physical Mapping and the consecutive ones property for sparse matrices |
Atkins, Jonathan E. |
1996 |
71 | 1-3 |
p. 23-40 18 p. |
article |
|
| 14 | On the complexity of comparing evolutionary trees |
Hein, Jotun |
1996 |
71 | 1-3 |
p. 153-169 17 p. |
article |
|
| 15 | On the complexity of string folding |
Paterson, Mike |
1996 |
71 | 1-3 |
p. 217-230 14 p. |
article |
|
| 16 | On the computational power of DNA |
Boneh, Dan |
1996 |
71 | 1-3 |
p. 79-94 16 p. |
article |
|
| 17 | On the primer selection problem in polymerase chain reaction experiments |
Pearson, William R. |
1996 |
71 | 1-3 |
p. 231-246 16 p. |
article |
|
| 18 | Polynomial-time algorithm for computing translocation distance between genomes |
Hannenhalli, Sridhar |
1996 |
71 | 1-3 |
p. 137-151 15 p. |
article |
|
| 19 | Shuffling biological sequences |
Kandel, D. |
1996 |
71 | 1-3 |
p. 171-185 15 p. |
article |
|
| 20 | Sorting with fixed-length reversals |
Chen, Ting |
1996 |
71 | 1-3 |
p. 269-295 27 p. |
article |
|
| 21 | The asymmetric median tree — A new model for building consensus trees |
Phillips, Cynthia |
1996 |
71 | 1-3 |
p. 311-335 25 p. |
article |
|
| 22 | Triangulating the surface of a molecule |
Akkiraju, Nataraj |
1996 |
71 | 1-3 |
p. 5-22 18 p. |
article |
22 results found