Efficient implied alignment
Abstract Background Given a binary tree T $\mathcal {T}$ of n leaves, each leaf labeled by a string of length at most k, and a binary string alignment function ⊗, an implied alignment can be generated to describe the alignment of a dynamic homology for T $\mathcal {T}$ . This is done by first decora...
Sábháilte in:
| Príomhchruthaitheoirí: | , |
|---|---|
| Formáid: | Artigo |
| Teanga: | Inglês |
| Foilsithe / Cruthaithe: |
BMC
2020-07-01
|
| Sraith: | BMC Bioinformatics |
| Ábhair: | |
| Rochtain ar líne: | http://link.springer.com/article/10.1186/s12859-020-03595-2 |
| Clibeanna: |
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|