• If you need only to compute the distance and not alignments, as is usually the case, it is easy to reduce this to o (n), since only the previous row is required to compute the next.

    如果您只需要计算距离,不需要校准,就像通常情况那样,那么可以很容易地把空间需求降到O (n),因为计算下一行只需要前面一行。

    youdao

  • Any candidate row for step (n + 1) that already exists in the ancestor path is simply ignored. In Oracle, the usage looks like this.

    对于第(n +1)步,任何在祖先中已经存在的候选行都将被忽略。

    youdao

  • There's no backslash n -- that would have forced the cursor on to the next row.

    但没有“反斜杠n“,反斜杠n是用来使光标移到下一行的。

    youdao

  • The purpose of this column is to show the number of the recursive step n that produced the row.

    这个列的作用是表明产生行的递归步骤n 属于第几步。

    youdao

  • The column name can contain '\ n', which sets up a multiple row column heading.

    列名称里包含有' \n ',让它能设置多行列标题。

    youdao

  • The column name can contain '\ n', which sets up a multiple row column heading.

    列名称里包含有' \n ',让它能设置多行列标题。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定