Date:
08/12/02 18:31
|
Submitted by:
J0ey4
|
Assigned to:
unset
|
Category:
Usability
|
Priority:
5
|
Ticket group:
feature request
|
Resolution:
Unset
|
Summary:
LOD algorithm for W-curve
|
Original submission:
We need to decide upon and implement an efficient LOD algorithm for trimming W-curves from millions of vertices down to thousands. For long sequences we should be able to reduce the number of vertices by a couple orders of magnitude without sacrificing any detail.
|
|
Please log in to add comments and receive followups via email.
|
|
No followups have been posted
|
|
No results for "Dependent on ticket"
|
No results for "Dependent on Task"
|
|
No other tickets are dependent on this ticket
|
|
No changes have been made to this ticket
|
![[University of Birmingham]](https://www.bioinformatics.org/images/ack_banners/Birmingham-728x90.gif)
![[Patsnap]](https://www.bioinformatics.org/images/ack_banners/Patsnap-728x90.png)
![[?]](https://www.bioinformatics.org/images/icons/info.png){kind=icon}
