Distributed and Sequential Algorithms for Bioinformatics
☆☆☆☆☆
(0 reviews)
Lowest price (incl. delivery)
7 149,00 JPY
Typical price527,12 PLN
Lowest (90 days)35,99 PLN
Offers6
Last updated1 hafta önce
Price history (90 days)
Full history
2026-08-08
2026-08-15
| Güncellenme Tarihi | Fiyat |
|---|---|
| 2026-08-08 | 39,99 |
| 2026-08-14 | 35,99 |
| 2026-08-15 | 51,99 |
| Satıcı | Product price | Delivery | Toplam | Stok Durumu | Updated | |
|---|---|---|---|---|---|---|
| SP SpringerNatureLink Shop INT | 7 149,00 JPY | free | 7 149,00 JPY | Mevcut | 4 gün önce | View offer |
| SP Springer Nature Author | 7 149,00 JPY | 29,00 JPY | 7 178,00 JPY | Mevcut | 1 hafta önce | View offer |
| SP SpringerNatureLink Shop INT | 49,99 USD | 29,00 USD | 78,99 USD | Mevcut | 4 gün önce | View offer |
| SP SpringerNatureLink Shop INT | 54,99 USD | 19,00 USD | 73,99 USD | Mevcut | 4 gün önce | View offer |
| SP SpringerNatureLink Shop INT | 54,99 USD | 29,00 USD | 83,99 USD | Mevcut | 4 gün önce | View offer |
| SP SpringerNatureLink Shop INT | 59,00 EUR | free | 59,00 EUR | Mevcut | 4 gün önce | View offer |
Fiyatlar ve stok durumu değişebilir. Son Güncelleme: 08.08.2026 23:08.
0,0
☆☆☆☆☆
0 reviews
5★
0%
4★
0%
3★
0%
2★
0%
1★
0%
Product reviews
No reviews yet — be the first!
This unique textbook/reference presents unified coverage of bioinformatics topics relating to both biological sequences and biological networks, providing an in-depth analysis of cutting-edge distributed algorithms, as well as of relevant sequential algorithms. In addition to introducing the latest algorithms in this area, more than fifteen new distributed algorithms are also proposed. Topics and features: reviews a range of open challenges in biological sequences and networks; describes in detail both sequential and parallel/distributed algorithms for each problem; suggests approaches for distributed algorithms as possible extensions to sequential algorithms, when the distributed algorithms for the topic are scarce; proposes a number of new distributed algorithms in each chapter, to serve as potential starting points for further research; concludes each chapter with self-test exercises, a summary of the key points, a comparison of the algorithms described, and a literature review.