1. The Internet is a graph [vertices = end hosts + routers, directed edges = direct physical or wireless connections].
2. Web graph. [vertices = web pages, edges = hyperlinks].
3. Social networks. [vertices = people, edges = friend/follow relationships].
4. If use Dijkstra's algorithm for routing, a router needs to know entire Internet!
Solution: the Bellman-Ford algorithm (bonus: also handles negative edge costs).
5. Sequence alignment problem ( useful for computational genomics ):
Input: 2 strings over {A,C,G,T}.
- Penalty Pen(gap) >= 0 for each gap.
- Penalty Pen(AT) >= 0 for mismatching A and T.
- etc.
Output: Alignment of the strings that minimizes the total penalty. ( Needleman-Wunsch score A.K.A. editorial distance)
Solution: Straightforward dynamic programming.
相关推荐
The combination of high-level management skills and technical knowledge has made Aleksa invaluable in motivating software teams�to bring the best out the themselves and make rapid progress toward ...
Twenty chapters introduce anddiscuss in detail the main cooperative strategies for the wholecommunication protocol stack from the application layer down to thephysical layer. Furthermore power saving...
3. **Team Management:** Approaches to organizing and motivating teams, resolving conflicts, and fostering collaboration. ### Technologies (WCF/WPF/WWF) In addition to .NET 3.0, the book discusses ...
The course is divided into seven modules, each focusing on a specific problem or application that motivates the use of certain techniques. Throughout the course, real-world implementations in Python ...