Timeline for Multiple Alignment cost application
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 16, 2020 at 12:22 | vote | accept | gcorso | ||
| Nov 15, 2020 at 19:25 | history | edited | Maximilian Press | CC BY-SA 4.0 |
update in response to comment.
|
| Nov 15, 2020 at 19:05 | comment | added | Maximilian Press | i'll just edit answer with response. | |
| Nov 15, 2020 at 10:50 | comment | added | gcorso | Thank you for the answer, do you have any specific procedure in mind where it could be useful as input? | |
| Nov 14, 2020 at 22:56 | comment | added | Maximilian Press | @gcorso i see. i share Michael's skepticism below. it seems to me like it will be highly dependent on the specifics of parameterization and the actual sequences, such that it will be low generalizability. possibly it could be useful as an intermediate heuristic computation that is an input to another procedure, but I don't think it would be easy to interpret on its own. | |
| Nov 14, 2020 at 15:57 | comment | added | gcorso | Thanks for the answer do you have any application in mind where the number of strings under analysis is >2. To be clearer I have some ideas for heuristics on the multiple sequences alignment problem (which is intractable) but these would not retrieve the aligned sequence, therefore, I was wondering whether such algorithm would be useful | |
| Nov 14, 2020 at 10:44 | history | answered | Maximilian Press | CC BY-SA 4.0 |